./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:11:43,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:11:43,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:11:43,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:11:43,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:11:44,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:11:44,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:11:44,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:11:44,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:11:44,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:11:44,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:11:44,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:11:44,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:11:44,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:11:44,029 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:11:44,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:11:44,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:11:44,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:11:44,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:11:44,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:11:44,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:11:44,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:11:44,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:11:44,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:11:44,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:11:44,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:11:44,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:11:44,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:11:44,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:11:44,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:44,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:11:44,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:11:44,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:11:44,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:11:44,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:11:44,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:11:44,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:11:44,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:11:44,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:11:44,043 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 [2024-10-14 06:11:44,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:11:44,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:11:44,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:11:44,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:11:44,373 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:11:44,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-10-14 06:11:45,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:11:46,197 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:11:46,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-10-14 06:11:46,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9bb732b/90c5490bfc0d448cae7e7178bd3e6968/FLAGf53288071 [2024-10-14 06:11:46,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9bb732b/90c5490bfc0d448cae7e7178bd3e6968 [2024-10-14 06:11:46,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:11:46,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:11:46,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:46,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:11:46,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:11:46,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc1def1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46, skipping insertion in model container [2024-10-14 06:11:46,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:11:46,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-10-14 06:11:46,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:46,578 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:11:46,592 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-10-14 06:11:46,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:46,668 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:11:46,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46 WrapperNode [2024-10-14 06:11:46,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:46,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:46,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:11:46,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:11:46,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,760 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 416 [2024-10-14 06:11:46,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:46,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:11:46,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:11:46,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:11:46,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,819 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 06:11:46,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:11:46,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:11:46,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:11:46,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:11:46,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (1/1) ... [2024-10-14 06:11:46,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:46,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:11:46,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:11:46,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:11:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:11:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:11:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:11:46,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:11:47,127 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:11:47,130 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:11:47,963 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-10-14 06:11:47,964 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:11:48,007 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:11:48,008 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:11:48,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:48 BoogieIcfgContainer [2024-10-14 06:11:48,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:11:48,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:11:48,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:11:48,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:11:48,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:11:46" (1/3) ... [2024-10-14 06:11:48,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656ab95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:48, skipping insertion in model container [2024-10-14 06:11:48,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:46" (2/3) ... [2024-10-14 06:11:48,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656ab95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:48, skipping insertion in model container [2024-10-14 06:11:48,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:48" (3/3) ... [2024-10-14 06:11:48,025 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2024-10-14 06:11:48,054 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:11:48,056 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:11:48,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:11:48,157 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@459c81df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:11:48,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:11:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 06:11:48,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:48,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:48,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:48,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1308562600, now seen corresponding path program 1 times [2024-10-14 06:11:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835470972] [2024-10-14 06:11:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835470972] [2024-10-14 06:11:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835470972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:11:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682391420] [2024-10-14 06:11:48,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:48,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:48,913 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:48,981 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2024-10-14 06:11:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-14 06:11:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:48,999 INFO L225 Difference]: With dead ends: 138 [2024-10-14 06:11:48,999 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 06:11:49,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:49,005 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:49,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 06:11:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 06:11:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-14 06:11:49,050 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 34 [2024-10-14 06:11:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:49,051 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-14 06:11:49,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-14 06:11:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 06:11:49,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:49,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:49,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:11:49,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:49,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1912430284, now seen corresponding path program 1 times [2024-10-14 06:11:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:49,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374002075] [2024-10-14 06:11:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:49,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:49,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374002075] [2024-10-14 06:11:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374002075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:49,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:11:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327956230] [2024-10-14 06:11:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:49,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:49,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:49,255 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:49,302 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2024-10-14 06:11:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-14 06:11:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:49,304 INFO L225 Difference]: With dead ends: 141 [2024-10-14 06:11:49,304 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 06:11:49,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:49,306 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:49,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 06:11:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 06:11:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-14 06:11:49,324 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 35 [2024-10-14 06:11:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:49,324 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-14 06:11:49,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-14 06:11:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:11:49,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:49,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:49,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:11:49,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1942169087, now seen corresponding path program 1 times [2024-10-14 06:11:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907418875] [2024-10-14 06:11:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:49,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:49,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907418875] [2024-10-14 06:11:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907418875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:11:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249169786] [2024-10-14 06:11:49,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:49,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:49,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:49,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:49,660 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:49,724 INFO L93 Difference]: Finished difference Result 141 states and 203 transitions. [2024-10-14 06:11:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:49,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-14 06:11:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:49,726 INFO L225 Difference]: With dead ends: 141 [2024-10-14 06:11:49,726 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 06:11:49,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:11:49,727 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 104 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:49,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 245 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 06:11:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 06:11:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-14 06:11:49,745 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 36 [2024-10-14 06:11:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:49,745 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-14 06:11:49,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-14 06:11:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 06:11:49,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:49,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:49,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:11:49,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1486845743, now seen corresponding path program 1 times [2024-10-14 06:11:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:49,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336259526] [2024-10-14 06:11:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:11:49,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:11:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:11:49,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:11:49,903 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:11:49,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:11:49,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:11:49,911 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 06:11:49,972 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:11:49,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:11:49 BoogieIcfgContainer [2024-10-14 06:11:49,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:11:49,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:11:49,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:11:49,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:11:49,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:48" (3/4) ... [2024-10-14 06:11:49,986 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:11:49,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:11:49,988 INFO L158 Benchmark]: Toolchain (without parser) took 3762.74ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 129.5MB in the beginning and 158.1MB in the end (delta: -28.6MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2024-10-14 06:11:49,988 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:49,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.15ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 111.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 06:11:49,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.53ms. Allocated memory is still 180.4MB. Free memory was 111.1MB in the beginning and 101.8MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 06:11:49,991 INFO L158 Benchmark]: Boogie Preprocessor took 121.40ms. Allocated memory is still 180.4MB. Free memory was 101.8MB in the beginning and 96.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 06:11:49,991 INFO L158 Benchmark]: RCFGBuilder took 1124.32ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 96.0MB in the beginning and 216.8MB in the end (delta: -120.8MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2024-10-14 06:11:49,993 INFO L158 Benchmark]: TraceAbstraction took 1966.45ms. Allocated memory is still 262.1MB. Free memory was 215.7MB in the beginning and 158.1MB in the end (delta: 57.6MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2024-10-14 06:11:49,993 INFO L158 Benchmark]: Witness Printer took 5.94ms. Allocated memory is still 262.1MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:49,995 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.15ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 111.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.53ms. Allocated memory is still 180.4MB. Free memory was 111.1MB in the beginning and 101.8MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.40ms. Allocated memory is still 180.4MB. Free memory was 101.8MB in the beginning and 96.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1124.32ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 96.0MB in the beginning and 216.8MB in the end (delta: -120.8MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1966.45ms. Allocated memory is still 262.1MB. Free memory was 215.7MB in the beginning and 158.1MB in the end (delta: 57.6MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Witness Printer took 5.94ms. Allocated memory is still 262.1MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 99. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_19_arg_0=1, var_19_arg_1=-2, var_29=0, var_75=1, var_9=0] [L99] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] EXPR var_19 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 625 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 381 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 06:11:50,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:11:52,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:11:52,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:11:52,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:11:52,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:11:52,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:11:52,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:11:52,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:11:52,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:11:52,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:11:52,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:11:52,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:11:52,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:11:52,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:11:52,558 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:11:52,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:11:52,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:11:52,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:11:52,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:11:52,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:11:52,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:11:52,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:11:52,565 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:11:52,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:11:52,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:11:52,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:11:52,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:11:52,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:11:52,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:11:52,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:11:52,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:11:52,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:52,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:11:52,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:11:52,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:11:52,575 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:11:52,575 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:11:52,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:11:52,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:11:52,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:11:52,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:11:52,579 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:11:52,579 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2ad67805566e6dd7791a2ce255a6cca7737f047950b2772f8edc9cba4cf8df2 [2024-10-14 06:11:52,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:11:52,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:11:52,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:11:52,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:11:52,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:11:52,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-10-14 06:11:54,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:11:55,066 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:11:55,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c [2024-10-14 06:11:55,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3acb3c71/608d47db737744a6b7f2bc8866e204c7/FLAG44d46e331 [2024-10-14 06:11:55,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3acb3c71/608d47db737744a6b7f2bc8866e204c7 [2024-10-14 06:11:55,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:11:55,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:11:55,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:55,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:11:55,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:11:55,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2cc466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55, skipping insertion in model container [2024-10-14 06:11:55,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:11:55,345 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-10-14 06:11:55,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:55,488 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:11:55,503 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v5.c[1249,1262] [2024-10-14 06:11:55,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:55,604 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:11:55,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55 WrapperNode [2024-10-14 06:11:55,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:55,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:55,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:11:55,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:11:55,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,686 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 248 [2024-10-14 06:11:55,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:55,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:11:55,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:11:55,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:11:55,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,740 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 06:11:55,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:11:55,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:11:55,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:11:55,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:11:55,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (1/1) ... [2024-10-14 06:11:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:55,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:11:55,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 06:11:55,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 06:11:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:11:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:11:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:11:55,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:11:56,061 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:11:56,064 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:11:56,411 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-14 06:11:56,413 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:11:56,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:11:56,475 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:11:56,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:56 BoogieIcfgContainer [2024-10-14 06:11:56,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:11:56,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:11:56,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:11:56,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:11:56,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:11:55" (1/3) ... [2024-10-14 06:11:56,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c896364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:56, skipping insertion in model container [2024-10-14 06:11:56,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:55" (2/3) ... [2024-10-14 06:11:56,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c896364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:56, skipping insertion in model container [2024-10-14 06:11:56,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:56" (3/3) ... [2024-10-14 06:11:56,489 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v5.c [2024-10-14 06:11:56,515 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:11:56,515 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:11:56,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:11:56,625 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@344d18a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:11:56,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:11:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:11:56,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:56,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:11:56,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:56,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:11:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:11:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371333215] [2024-10-14 06:11:56,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:56,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:11:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:11:56,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:11:56,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 06:11:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:56,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 06:11:56,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:11:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:57,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:11:57,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:11:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371333215] [2024-10-14 06:11:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371333215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:57,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:57,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:11:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770477154] [2024-10-14 06:11:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:57,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:11:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:57,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:57,099 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:57,148 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-14 06:11:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:57,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 06:11:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:57,163 INFO L225 Difference]: With dead ends: 14 [2024-10-14 06:11:57,163 INFO L226 Difference]: Without dead ends: 8 [2024-10-14 06:11:57,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:57,174 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:57,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-14 06:11:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-14 06:11:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:11:57,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:11:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:57,208 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:11:57,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:11:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:11:57,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:57,209 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:11:57,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 06:11:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:11:57,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:57,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:11:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:11:57,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451267829] [2024-10-14 06:11:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:11:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:11:57,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:11:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 06:11:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:57,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 06:11:57,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:11:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:57,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:11:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:59,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:11:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451267829] [2024-10-14 06:11:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451267829] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:11:59,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:11:59,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 06:11:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116802256] [2024-10-14 06:11:59,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:11:59,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:11:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:11:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:11:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:11:59,985 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:12:00,464 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 06:12:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:12:00,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 06:12:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:12:00,466 INFO L225 Difference]: With dead ends: 13 [2024-10-14 06:12:00,466 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 06:12:00,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:12:00,468 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:12:00,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:12:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 06:12:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 06:12:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 06:12:00,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 06:12:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:12:00,480 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 06:12:00,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 06:12:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 06:12:00,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:12:00,481 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 06:12:00,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 06:12:00,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:12:00,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:12:00,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:12:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 06:12:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:12:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924827924] [2024-10-14 06:12:00,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 06:12:00,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:12:00,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:12:00,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:12:00,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 06:12:00,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 06:12:00,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 06:12:00,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 06:12:00,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:12:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:12:02,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:12:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:12:26,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:12:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924827924] [2024-10-14 06:12:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924827924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:12:26,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:12:26,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 06:12:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227637029] [2024-10-14 06:12:26,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:12:26,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 06:12:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:12:26,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 06:12:26,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2024-10-14 06:12:26,268 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:12:41,655 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-14 06:12:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 06:12:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 06:12:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:12:41,657 INFO L225 Difference]: With dead ends: 16 [2024-10-14 06:12:41,657 INFO L226 Difference]: Without dead ends: 14 [2024-10-14 06:12:41,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=59, Invalid=149, Unknown=2, NotChecked=0, Total=210 [2024-10-14 06:12:41,659 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 06:12:41,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 06:12:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-14 06:12:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-14 06:12:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-14 06:12:41,665 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-14 06:12:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:12:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-14 06:12:41,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-14 06:12:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 06:12:41,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:12:41,666 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-14 06:12:41,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 06:12:41,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:12:41,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:12:41,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:12:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-14 06:12:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:12:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588390052] [2024-10-14 06:12:41,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 06:12:41,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:12:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:12:41,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 06:12:41,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 06:12:41,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-14 06:12:41,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 06:12:41,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:12:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:12:42,230 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 06:12:42,230 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:12:42,235 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:12:42,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 06:12:42,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:12:42,441 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-14 06:12:42,491 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:12:42,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:12:42 BoogieIcfgContainer [2024-10-14 06:12:42,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:12:42,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:12:42,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:12:42,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:12:42,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:56" (3/4) ... [2024-10-14 06:12:42,499 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 06:12:42,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 06:12:42,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:12:42,618 INFO L158 Benchmark]: Toolchain (without parser) took 47514.08ms. Allocated memory was 58.7MB in the beginning and 107.0MB in the end (delta: 48.2MB). Free memory was 34.5MB in the beginning and 36.4MB in the end (delta: -1.9MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-10-14 06:12:42,618 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 58.7MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:12:42,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.43ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 34.2MB in the beginning and 48.2MB in the end (delta: -14.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-10-14 06:12:42,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.04ms. Allocated memory is still 73.4MB. Free memory was 48.2MB in the beginning and 45.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 06:12:42,619 INFO L158 Benchmark]: Boogie Preprocessor took 76.42ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 06:12:42,619 INFO L158 Benchmark]: RCFGBuilder took 710.99ms. Allocated memory is still 73.4MB. Free memory was 41.9MB in the beginning and 33.6MB in the end (delta: 8.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-14 06:12:42,621 INFO L158 Benchmark]: TraceAbstraction took 46015.33ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 32.9MB in the beginning and 45.8MB in the end (delta: -13.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-10-14 06:12:42,621 INFO L158 Benchmark]: Witness Printer took 122.33ms. Allocated memory is still 107.0MB. Free memory was 45.8MB in the beginning and 36.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 06:12:42,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 58.7MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.43ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 34.2MB in the beginning and 48.2MB in the end (delta: -14.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.04ms. Allocated memory is still 73.4MB. Free memory was 48.2MB in the beginning and 45.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.42ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 710.99ms. Allocated memory is still 73.4MB. Free memory was 41.9MB in the beginning and 33.6MB in the end (delta: 8.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 46015.33ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 32.9MB in the beginning and 45.8MB in the end (delta: -13.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Witness Printer took 122.33ms. Allocated memory is still 107.0MB. Free memory was 45.8MB in the beginning and 36.4MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) [L102] RET __VERIFIER_assert(!(bad_20_arg_0)) [L104] SORT_5 var_52_arg_0 = input_8; [L105] SORT_5 var_52_arg_1 = var_17; [L106] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L107] SORT_5 var_53_arg_0 = var_52; [L108] SORT_1 var_53_arg_1 = var_9; [L109] SORT_1 var_53_arg_2 = state_41; [L110] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L111] var_53 = var_53 & mask_SORT_1 [L112] SORT_1 next_54_arg_1 = var_53; [L113] SORT_5 var_58_arg_0 = input_8; [L114] SORT_5 var_58_arg_1 = var_17; [L115] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L116] SORT_1 var_56_arg_0 = state_36; [L117] SORT_1 var_56_arg_1 = state_32; [L118] SORT_1 var_56 = var_56_arg_0 - var_56_arg_1; [L119] SORT_1 var_55_arg_0 = state_36; [L120] SORT_1 var_55_arg_1 = state_32; [L121] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L122] SORT_5 var_57_arg_0 = state_34; [L123] SORT_1 var_57_arg_1 = var_56; [L124] SORT_1 var_57_arg_2 = var_55; [L125] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L126] SORT_5 var_59_arg_0 = var_58; [L127] SORT_1 var_59_arg_1 = var_9; [L128] SORT_1 var_59_arg_2 = var_57; [L129] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L130] var_59 = var_59 & mask_SORT_1 [L131] SORT_1 next_60_arg_1 = var_59; [L132] SORT_5 var_61_arg_0 = var_58; [L133] SORT_1 var_61_arg_1 = var_9; [L134] SORT_1 var_61_arg_2 = input_2; [L135] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L136] SORT_1 next_62_arg_1 = var_61; [L137] SORT_5 var_63_arg_0 = var_58; [L138] SORT_1 var_63_arg_1 = var_9; [L139] SORT_1 var_63_arg_2 = input_3; [L140] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L141] SORT_1 next_64_arg_1 = var_63; [L142] SORT_5 var_65_arg_0 = var_58; [L143] SORT_1 var_65_arg_1 = var_9; [L144] SORT_1 var_65_arg_2 = input_4; [L145] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L146] SORT_1 next_66_arg_1 = var_65; [L147] SORT_5 var_67_arg_0 = var_58; [L148] SORT_5 var_67_arg_1 = var_29; [L149] SORT_5 var_67_arg_2 = input_7; [L150] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L151] SORT_5 next_68_arg_1 = var_67; [L152] SORT_5 var_69_arg_0 = var_58; [L153] SORT_1 var_69_arg_1 = var_9; [L154] SORT_1 var_69_arg_2 = state_25; [L155] SORT_1 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L156] SORT_1 next_70_arg_1 = var_69; [L157] SORT_5 var_71_arg_0 = var_58; [L158] SORT_5 var_71_arg_1 = var_29; [L159] SORT_5 var_71_arg_2 = state_30; [L160] SORT_5 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L161] var_71 = var_71 & mask_SORT_5 [L162] SORT_5 next_72_arg_1 = var_71; [L163] SORT_1 var_76_arg_0 = state_21; [L164] SORT_1 var_76_arg_1 = var_75; [L165] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L166] var_76 = var_76 & mask_SORT_1 [L167] SORT_1 var_77_arg_0 = var_76; [L168] SORT_1 var_77_arg_1 = var_75; [L169] SORT_5 var_77 = var_77_arg_0 == var_77_arg_1; [L170] SORT_1 var_74_arg_0 = state_21; [L171] SORT_1 var_74_arg_1 = state_23; [L172] SORT_1 var_74 = var_74_arg_0 + var_74_arg_1; [L173] SORT_1 var_73_arg_0 = state_21; [L174] SORT_1 var_73_arg_1 = state_23; [L175] SORT_1 var_73 = var_73_arg_0 - var_73_arg_1; [L176] SORT_5 var_78_arg_0 = var_77; [L177] SORT_1 var_78_arg_1 = var_74; [L178] SORT_1 var_78_arg_2 = var_73; [L179] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L180] SORT_5 var_79_arg_0 = var_58; [L181] SORT_1 var_79_arg_1 = var_9; [L182] SORT_1 var_79_arg_2 = var_78; [L183] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L184] SORT_1 next_80_arg_1 = var_79; [L185] SORT_1 var_45_arg_0 = input_2; [L186] SORT_5 var_45 = var_45_arg_0 >> 0; [L187] var_45 = var_45 & mask_SORT_5 [L188] SORT_1 var_44_arg_0 = input_2; [L189] SORT_1 var_44_arg_1 = input_3; [L190] SORT_1 var_44 = var_44_arg_0 + var_44_arg_1; [L191] SORT_1 var_43_arg_0 = input_2; [L192] SORT_1 var_43_arg_1 = input_3; [L193] SORT_1 var_43 = var_43_arg_0 - var_43_arg_1; [L194] SORT_5 var_46_arg_0 = var_45; [L195] SORT_1 var_46_arg_1 = var_44; [L196] SORT_1 var_46_arg_2 = var_43; [L197] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L198] SORT_1 var_48_arg_0 = var_46; [L199] SORT_1 var_48_arg_1 = input_4; [L200] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L201] SORT_1 var_47_arg_0 = var_46; [L202] SORT_1 var_47_arg_1 = input_4; [L203] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L204] SORT_5 var_49_arg_0 = input_7; [L205] SORT_1 var_49_arg_1 = var_48; [L206] SORT_1 var_49_arg_2 = var_47; [L207] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L208] SORT_5 var_81_arg_0 = var_52; [L209] SORT_1 var_81_arg_1 = var_9; [L210] SORT_1 var_81_arg_2 = var_49; [L211] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L212] SORT_1 next_82_arg_1 = var_81; [L213] SORT_5 var_83_arg_0 = var_52; [L214] SORT_1 var_83_arg_1 = var_9; [L215] SORT_1 var_83_arg_2 = state_39; [L216] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L217] SORT_1 next_84_arg_1 = var_83; [L219] state_10 = next_54_arg_1 [L220] state_12 = next_60_arg_1 [L221] state_21 = next_62_arg_1 [L222] state_23 = next_64_arg_1 [L223] state_25 = next_66_arg_1 [L224] state_30 = next_68_arg_1 [L225] state_32 = next_70_arg_1 [L226] state_34 = next_72_arg_1 [L227] state_36 = next_80_arg_1 [L228] state_39 = next_82_arg_1 [L229] state_41 = next_84_arg_1 [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 7 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 33 ConstructedInterpolants, 14 QuantifiedInterpolants, 1881 SizeOfPredicates, 16 NumberOfNonLiveVariables, 204 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 06:12:42,847 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-14 06:12:43,048 FATAL L548 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Could not destroy process within 200 ms, abandoning it Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE