/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_spinner32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 22:36:10,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 22:36:10,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-16 22:36:10,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 22:36:10,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 22:36:10,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 22:36:10,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 22:36:10,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 22:36:10,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 22:36:10,238 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 22:36:10,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 22:36:10,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 22:36:10,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 22:36:10,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 22:36:10,240 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 22:36:10,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 22:36:10,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 22:36:10,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 22:36:10,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 22:36:10,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 22:36:10,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 22:36:10,251 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 22:36:10,251 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 22:36:10,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 22:36:10,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 22:36:10,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 22:36:10,254 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 22:36:10,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 22:36:10,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 22:36:10,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 22:36:10,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 22:36:10,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:36:10,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 22:36:10,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 22:36:10,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 22:36:10,257 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 22:36:10,257 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 [2023-12-16 22:36:10,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 22:36:10,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 22:36:10,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 22:36:10,466 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 22:36:10,466 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 22:36:10,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_spinner32.c [2023-12-16 22:36:11,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 22:36:11,578 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 22:36:11,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_spinner32.c [2023-12-16 22:36:11,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf389db69/b07c1149c9344d3395eaf8e2d425618c/FLAG8c0d0c6fe [2023-12-16 22:36:11,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf389db69/b07c1149c9344d3395eaf8e2d425618c [2023-12-16 22:36:11,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 22:36:11,596 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 22:36:11,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 22:36:11,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 22:36:11,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 22:36:11,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c410e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11, skipping insertion in model container [2023-12-16 22:36:11,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,639 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 22:36:11,743 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_spinner32.c[1259,1272] [2023-12-16 22:36:11,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:36:11,808 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 22:36:11,816 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_spinner32.c[1259,1272] [2023-12-16 22:36:11,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:36:11,867 INFO L206 MainTranslator]: Completed translation [2023-12-16 22:36:11,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11 WrapperNode [2023-12-16 22:36:11,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 22:36:11,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 22:36:11,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 22:36:11,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 22:36:11,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,950 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 230 [2023-12-16 22:36:11,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 22:36:11,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 22:36:11,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 22:36:11,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 22:36:11,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,972 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]. [2023-12-16 22:36:11,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:11,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 22:36:11,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 22:36:11,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 22:36:11,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 22:36:11,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (1/1) ... [2023-12-16 22:36:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:36:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 22:36:12,038 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) [2023-12-16 22:36:12,044 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 [2023-12-16 22:36:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 22:36:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 22:36:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 22:36:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 22:36:12,168 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 22:36:12,169 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 22:36:12,390 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 22:36:12,433 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 22:36:12,433 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 22:36:12,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:36:12 BoogieIcfgContainer [2023-12-16 22:36:12,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 22:36:12,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 22:36:12,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 22:36:12,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 22:36:12,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 10:36:11" (1/3) ... [2023-12-16 22:36:12,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c43a879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:36:12, skipping insertion in model container [2023-12-16 22:36:12,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:36:11" (2/3) ... [2023-12-16 22:36:12,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c43a879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:36:12, skipping insertion in model container [2023-12-16 22:36:12,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:36:12" (3/3) ... [2023-12-16 22:36:12,439 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_spinner32.c [2023-12-16 22:36:12,450 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 22:36:12,450 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 22:36:12,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 22:36:12,480 INFO L357 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, mHoare=true, 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;@185e8f64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 22:36:12,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 22:36:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-12-16 22:36:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 22:36:12,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:36:12,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 22:36:12,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:36:12,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:36:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 22:36:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:36:12,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027744704] [2023-12-16 22:36:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:36:12,499 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 [2023-12-16 22:36:12,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:36:12,500 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) [2023-12-16 22:36:12,504 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 [2023-12-16 22:36:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:36:12,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 22:36:12,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:36:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:36:12,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 22:36:12,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:36:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027744704] [2023-12-16 22:36:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027744704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 22:36:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 22:36:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 22:36:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568840177] [2023-12-16 22:36:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 22:36:12,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 22:36:12,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:36:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 22:36:12,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 22:36:12,778 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-12-16 22:36:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:36:12,829 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 22:36:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 22:36:12,831 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 [2023-12-16 22:36:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:36:12,836 INFO L225 Difference]: With dead ends: 16 [2023-12-16 22:36:12,836 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 22:36:12,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 22:36:12,841 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 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 [2023-12-16 22:36:12,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 22:36:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 22:36:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 22:36:12,862 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) [2023-12-16 22:36:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 22:36:12,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 22:36:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:36:12,863 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 22:36:12,863 INFO L496 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) [2023-12-16 22:36:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 22:36:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 22:36:12,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:36:12,864 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 22:36:12,869 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 [2023-12-16 22:36:13,067 WARN L477 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 [2023-12-16 22:36:13,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:36:13,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:36:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 22:36:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:36:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648857952] [2023-12-16 22:36:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:36:13,070 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 [2023-12-16 22:36:13,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:36:13,071 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) [2023-12-16 22:36:13,073 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 [2023-12-16 22:36:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:36:13,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-16 22:36:13,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:36:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:36:14,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:36:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:36:26,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:36:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648857952] [2023-12-16 22:36:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648857952] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:36:26,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:36:26,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 22:36:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650327791] [2023-12-16 22:36:26,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:36:26,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 22:36:26,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:36:26,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 22:36:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2023-12-16 22:36:26,147 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) [2023-12-16 22:36:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:36:26,948 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-16 22:36:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 22:36:26,948 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 [2023-12-16 22:36:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:36:26,949 INFO L225 Difference]: With dead ends: 14 [2023-12-16 22:36:26,949 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 22:36:26,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=38, Invalid=71, Unknown=1, NotChecked=0, Total=110 [2023-12-16 22:36:26,950 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 22:36:26,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 22:36:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 22:36:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-16 22:36:26,953 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) [2023-12-16 22:36:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-16 22:36:26,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-16 22:36:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:36:26,954 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-16 22:36:26,954 INFO L496 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) [2023-12-16 22:36:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-16 22:36:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 22:36:26,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:36:26,954 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-16 22:36:26,958 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 [2023-12-16 22:36:27,157 WARN L477 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 [2023-12-16 22:36:27,158 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:36:27,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:36:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-16 22:36:27,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:36:27,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130929123] [2023-12-16 22:36:27,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 22:36:27,159 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 [2023-12-16 22:36:27,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:36:27,160 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) [2023-12-16 22:36:27,170 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 [2023-12-16 22:36:27,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 22:36:27,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 22:36:27,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 22:36:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 22:36:27,496 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 22:36:27,496 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 22:36:27,497 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 22:36:27,506 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 22:36:27,699 WARN L477 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 [2023-12-16 22:36:27,702 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-12-16 22:36:27,704 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 22:36:27,747 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:36:27,747 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:36:27,747 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:36:27,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 10:36:27 BoogieIcfgContainer [2023-12-16 22:36:27,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 22:36:27,763 INFO L158 Benchmark]: Toolchain (without parser) took 16166.36ms. Allocated memory was 205.5MB in the beginning and 540.0MB in the end (delta: 334.5MB). Free memory was 141.1MB in the beginning and 341.5MB in the end (delta: -200.4MB). Peak memory consumption was 134.9MB. Max. memory is 8.0GB. [2023-12-16 22:36:27,763 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 22:36:27,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.52ms. Allocated memory is still 205.5MB. Free memory was 140.9MB in the beginning and 123.8MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 22:36:27,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.07ms. Allocated memory was 205.5MB in the beginning and 311.4MB in the end (delta: 105.9MB). Free memory was 123.8MB in the beginning and 276.6MB in the end (delta: -152.8MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2023-12-16 22:36:27,764 INFO L158 Benchmark]: Boogie Preprocessor took 32.32ms. Allocated memory is still 311.4MB. Free memory was 276.5MB in the beginning and 273.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 22:36:27,764 INFO L158 Benchmark]: RCFGBuilder took 449.91ms. Allocated memory is still 311.4MB. Free memory was 273.4MB in the beginning and 256.5MB in the end (delta: 16.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 22:36:27,765 INFO L158 Benchmark]: TraceAbstraction took 15327.37ms. Allocated memory was 311.4MB in the beginning and 540.0MB in the end (delta: 228.6MB). Free memory was 256.0MB in the beginning and 341.5MB in the end (delta: -85.5MB). Peak memory consumption was 142.6MB. Max. memory is 8.0GB. [2023-12-16 22:36:27,766 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.09ms. Allocated memory is still 205.5MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.52ms. Allocated memory is still 205.5MB. Free memory was 140.9MB in the beginning and 123.8MB in the end (delta: 17.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.07ms. Allocated memory was 205.5MB in the beginning and 311.4MB in the end (delta: 105.9MB). Free memory was 123.8MB in the beginning and 276.6MB in the end (delta: -152.8MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.32ms. Allocated memory is still 311.4MB. Free memory was 276.5MB in the beginning and 273.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 449.91ms. Allocated memory is still 311.4MB. Free memory was 273.4MB in the beginning and 256.5MB in the end (delta: 16.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 15327.37ms. Allocated memory was 311.4MB in the beginning and 540.0MB in the end (delta: 228.6MB). Free memory was 256.0MB in the beginning and 341.5MB in the end (delta: -85.5MB). Peak memory consumption was 142.6MB. Max. memory is 8.0GB. * 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 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_25 mask_SORT_25 = (SORT_25)-1 >> (sizeof(SORT_25) * 8 - 31); [L36] const SORT_25 msb_SORT_25 = (SORT_25)1 << (31 - 1); [L38] const SORT_35 mask_SORT_35 = (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 30); [L39] const SORT_35 msb_SORT_35 = (SORT_35)1 << (30 - 1); [L41] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 29); [L42] const SORT_37 msb_SORT_37 = (SORT_37)1 << (29 - 1); [L44] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 2); [L45] const SORT_43 msb_SORT_43 = (SORT_43)1 << (2 - 1); [L47] const SORT_49 mask_SORT_49 = (SORT_49)-1 >> (sizeof(SORT_49) * 8 - 28); [L48] const SORT_49 msb_SORT_49 = (SORT_49)1 << (28 - 1); [L50] const SORT_51 mask_SORT_51 = (SORT_51)-1 >> (sizeof(SORT_51) * 8 - 26); [L51] const SORT_51 msb_SORT_51 = (SORT_51)1 << (26 - 1); [L53] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 4); [L54] const SORT_57 msb_SORT_57 = (SORT_57)1 << (4 - 1); [L56] const SORT_63 mask_SORT_63 = (SORT_63)-1 >> (sizeof(SORT_63) * 8 - 24); [L57] const SORT_63 msb_SORT_63 = (SORT_63)1 << (24 - 1); [L59] const SORT_65 mask_SORT_65 = (SORT_65)-1 >> (sizeof(SORT_65) * 8 - 20); [L60] const SORT_65 msb_SORT_65 = (SORT_65)1 << (20 - 1); [L62] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 8); [L63] const SORT_71 msb_SORT_71 = (SORT_71)1 << (8 - 1); [L65] const SORT_77 mask_SORT_77 = (SORT_77)-1 >> (sizeof(SORT_77) * 8 - 16); [L66] const SORT_77 msb_SORT_77 = (SORT_77)1 << (16 - 1); [L68] const SORT_5 var_8 = 0; [L69] const SORT_5 var_11 = 2863311530; [L70] const SORT_3 var_15 = 1; [L71] const SORT_3 var_22 = 0; [L73] SORT_1 input_2; [L74] SORT_3 input_4; [L75] SORT_5 input_6; [L76] SORT_3 input_7; [L78] SORT_5 state_9 = __VERIFIER_nondet_uint() & mask_SORT_5; [L79] SORT_5 state_19 = __VERIFIER_nondet_uint() & mask_SORT_5; [L80] SORT_3 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L82] SORT_5 init_10_arg_1 = var_8; [L83] state_9 = init_10_arg_1 [L84] SORT_5 init_20_arg_1 = var_8; [L85] state_19 = init_20_arg_1 [L86] SORT_3 init_24_arg_1 = var_22; [L87] state_23 = init_24_arg_1 VAL [init_10_arg_1=0, init_20_arg_1=0, init_24_arg_1=0, mask_SORT_1=31, mask_SORT_25=2147483647, mask_SORT_35=1073741823, mask_SORT_37=536870911, mask_SORT_3=1, mask_SORT_43=3, mask_SORT_49=268435455, mask_SORT_51=67108863, mask_SORT_57=15, mask_SORT_5=4294967295, mask_SORT_63=16777215, mask_SORT_65=1048575, mask_SORT_71=255, mask_SORT_77=65535, msb_SORT_1=16, msb_SORT_25=1073741824, msb_SORT_35=536870912, msb_SORT_37=268435456, msb_SORT_3=1, msb_SORT_43=2, msb_SORT_49=134217728, msb_SORT_51=33554432, msb_SORT_57=8, msb_SORT_5=2147483648, msb_SORT_63=8388608, msb_SORT_65=524288, msb_SORT_71=128, msb_SORT_77=32768, state_19=0, state_23=0, state_9=0, var_11=2863311530, var_15=1, var_22=0, var_8=0] [L90] input_2 = __VERIFIER_nondet_uchar() [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_6 = __VERIFIER_nondet_uint() [L93] input_7 = __VERIFIER_nondet_uchar() [L94] input_7 = input_7 & mask_SORT_3 [L97] SORT_5 var_12_arg_0 = state_9; [L98] SORT_5 var_12_arg_1 = var_11; [L99] SORT_3 var_12 = var_12_arg_0 != var_12_arg_1; [L100] SORT_3 var_16_arg_0 = var_12; [L101] SORT_3 var_16 = ~var_16_arg_0; [L102] SORT_3 var_17_arg_0 = var_15; [L103] SORT_3 var_17_arg_1 = var_16; [L104] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L105] var_17 = var_17 & mask_SORT_3 [L106] SORT_3 bad_18_arg_0 = var_17; [L107] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L107] RET __VERIFIER_assert(!(bad_18_arg_0)) [L109] SORT_1 var_81_arg_0 = input_2; [L110] SORT_3 var_81 = var_81_arg_0 >> 4; [L111] var_81 = var_81 & mask_SORT_3 [L112] SORT_1 var_68_arg_0 = input_2; [L113] SORT_3 var_68 = var_68_arg_0 >> 3; [L114] var_68 = var_68 & mask_SORT_3 [L115] SORT_1 var_54_arg_0 = input_2; [L116] SORT_3 var_54 = var_54_arg_0 >> 2; [L117] var_54 = var_54 & mask_SORT_3 [L118] SORT_1 var_40_arg_0 = input_2; [L119] SORT_3 var_40 = var_40_arg_0 >> 1; [L120] var_40 = var_40 & mask_SORT_3 [L121] SORT_1 var_28_arg_0 = input_2; [L122] SORT_3 var_28 = var_28_arg_0 >> 0; [L123] var_28 = var_28 & mask_SORT_3 [L124] SORT_5 var_32_arg_0 = state_19; [L125] SORT_3 var_32 = var_32_arg_0 >> 0; [L126] SORT_5 var_31_arg_0 = state_19; [L127] SORT_3 var_31 = var_31_arg_0 >> 31; [L128] SORT_3 var_33_arg_0 = var_28; [L129] SORT_3 var_33_arg_1 = var_32; [L130] SORT_3 var_33_arg_2 = var_31; [L131] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L132] SORT_5 var_27_arg_0 = state_19; [L133] SORT_25 var_27 = var_27_arg_0 >> 1; [L134] SORT_5 var_26_arg_0 = state_19; [L135] SORT_25 var_26 = var_26_arg_0 >> 0; [L136] SORT_3 var_29_arg_0 = var_28; [L137] SORT_25 var_29_arg_1 = var_27; [L138] SORT_25 var_29_arg_2 = var_26; [L139] SORT_25 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L140] SORT_25 var_38_arg_0 = var_29; [L141] SORT_37 var_38 = var_38_arg_0 >> 2; [L142] var_38 = var_38 & mask_SORT_37 [L143] SORT_3 var_39_arg_0 = var_33; [L144] SORT_37 var_39_arg_1 = var_38; [L145] SORT_35 var_39 = ((SORT_35)var_39_arg_0 << 29) | var_39_arg_1; [L146] SORT_25 var_36_arg_0 = var_29; [L147] SORT_35 var_36 = var_36_arg_0 >> 0; [L148] SORT_3 var_41_arg_0 = var_40; [L149] SORT_35 var_41_arg_1 = var_39; [L150] SORT_35 var_41_arg_2 = var_36; [L151] SORT_35 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L152] SORT_35 var_60_arg_0 = var_41; [L153] SORT_57 var_60 = var_60_arg_0 >> 0; [L154] SORT_25 var_46_arg_0 = var_29; [L155] SORT_43 var_46 = var_46_arg_0 >> 0; [L156] SORT_25 var_44_arg_0 = var_29; [L157] SORT_3 var_44 = var_44_arg_0 >> 30; [L158] var_44 = var_44 & mask_SORT_3 [L159] SORT_3 var_45_arg_0 = var_33; [L160] SORT_3 var_45_arg_1 = var_44; [L161] SORT_43 var_45 = ((SORT_43)var_45_arg_0 << 1) | var_45_arg_1; [L162] SORT_3 var_47_arg_0 = var_40; [L163] SORT_43 var_47_arg_1 = var_46; [L164] SORT_43 var_47_arg_2 = var_45; [L165] SORT_43 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L166] SORT_35 var_58_arg_0 = var_41; [L167] SORT_43 var_58 = var_58_arg_0 >> 28; [L168] var_58 = var_58 & mask_SORT_43 [L169] SORT_43 var_59_arg_0 = var_47; [L170] SORT_43 var_59_arg_1 = var_58; [L171] SORT_57 var_59 = ((SORT_57)var_59_arg_0 << 2) | var_59_arg_1; [L172] SORT_3 var_61_arg_0 = var_54; [L173] SORT_57 var_61_arg_1 = var_60; [L174] SORT_57 var_61_arg_2 = var_59; [L175] SORT_57 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L176] SORT_35 var_52_arg_0 = var_41; [L177] SORT_51 var_52 = var_52_arg_0 >> 4; [L178] var_52 = var_52 & mask_SORT_51 [L179] SORT_43 var_53_arg_0 = var_47; [L180] SORT_51 var_53_arg_1 = var_52; [L181] SORT_49 var_53 = ((SORT_49)var_53_arg_0 << 26) | var_53_arg_1; [L182] SORT_35 var_50_arg_0 = var_41; [L183] SORT_49 var_50 = var_50_arg_0 >> 0; [L184] SORT_3 var_55_arg_0 = var_54; [L185] SORT_49 var_55_arg_1 = var_53; [L186] SORT_49 var_55_arg_2 = var_50; [L187] SORT_49 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L188] SORT_49 var_66_arg_0 = var_55; [L189] SORT_65 var_66 = var_66_arg_0 >> 8; [L190] var_66 = var_66 & mask_SORT_65 [L191] SORT_57 var_67_arg_0 = var_61; [L192] SORT_65 var_67_arg_1 = var_66; [L193] SORT_63 var_67 = ((SORT_63)var_67_arg_0 << 20) | var_67_arg_1; [L194] SORT_49 var_64_arg_0 = var_55; [L195] SORT_63 var_64 = var_64_arg_0 >> 0; [L196] SORT_3 var_69_arg_0 = var_68; [L197] SORT_63 var_69_arg_1 = var_67; [L198] SORT_63 var_69_arg_2 = var_64; [L199] SORT_63 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L200] SORT_63 var_78_arg_0 = var_69; [L201] SORT_77 var_78 = var_78_arg_0 >> 0; [L202] SORT_49 var_74_arg_0 = var_55; [L203] SORT_71 var_74 = var_74_arg_0 >> 0; [L204] SORT_49 var_72_arg_0 = var_55; [L205] SORT_57 var_72 = var_72_arg_0 >> 24; [L206] var_72 = var_72 & mask_SORT_57 [L207] SORT_57 var_73_arg_0 = var_61; [L208] SORT_57 var_73_arg_1 = var_72; [L209] SORT_71 var_73 = ((SORT_71)var_73_arg_0 << 4) | var_73_arg_1; [L210] SORT_3 var_75_arg_0 = var_68; [L211] SORT_71 var_75_arg_1 = var_74; [L212] SORT_71 var_75_arg_2 = var_73; [L213] SORT_71 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L214] SORT_63 var_79_arg_0 = var_69; [L215] SORT_71 var_79 = var_79_arg_0 >> 16; [L216] var_79 = var_79 & mask_SORT_71 [L217] SORT_71 var_80_arg_0 = var_75; [L218] SORT_71 var_80_arg_1 = var_79; [L219] SORT_77 var_80 = ((SORT_77)var_80_arg_0 << 8) | var_80_arg_1; [L220] SORT_3 var_84_arg_0 = var_81; [L221] SORT_77 var_84_arg_1 = var_78; [L222] SORT_77 var_84_arg_2 = var_80; [L223] SORT_77 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L224] SORT_3 var_82_arg_0 = var_81; [L225] SORT_77 var_82_arg_1 = var_80; [L226] SORT_77 var_82_arg_2 = var_78; [L227] SORT_77 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L228] var_82 = var_82 & mask_SORT_77 [L229] SORT_77 var_86_arg_0 = var_84; [L230] SORT_77 var_86_arg_1 = var_82; [L231] SORT_5 var_86 = ((SORT_5)var_86_arg_0 << 16) | var_86_arg_1; [L232] var_86 = var_86 & mask_SORT_5 [L233] SORT_5 next_87_arg_1 = var_86; [L234] SORT_3 var_88_arg_0 = state_23; [L235] SORT_5 var_88_arg_1 = state_9; [L236] SORT_5 var_88_arg_2 = input_6; [L237] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L238] SORT_5 next_89_arg_1 = var_88; [L239] SORT_3 next_90_arg_1 = input_7; [L241] state_9 = next_87_arg_1 [L242] state_19 = next_89_arg_1 [L243] state_23 = next_90_arg_1 VAL [bad_18_arg_0=0, init_10_arg_1=0, init_20_arg_1=0, init_24_arg_1=0, input_2=0, input_6=2863311530, input_7=0, mask_SORT_1=31, mask_SORT_25=2147483647, mask_SORT_35=1073741823, mask_SORT_37=536870911, mask_SORT_3=1, mask_SORT_43=3, mask_SORT_49=268435455, mask_SORT_51=67108863, mask_SORT_57=15, mask_SORT_5=4294967295, mask_SORT_63=16777215, mask_SORT_65=1048575, mask_SORT_71=255, mask_SORT_77=65535, msb_SORT_1=16, msb_SORT_25=1073741824, msb_SORT_35=536870912, msb_SORT_37=268435456, msb_SORT_3=1, msb_SORT_43=2, msb_SORT_49=134217728, msb_SORT_51=33554432, msb_SORT_57=8, msb_SORT_5=2147483648, msb_SORT_63=8388608, msb_SORT_65=524288, msb_SORT_71=128, msb_SORT_77=32768, next_87_arg_1=0, next_89_arg_1=2863311530, next_90_arg_1=0, state_19=2863311530, state_23=0, state_9=0, var_11=2863311530, var_12=1, var_12_arg_0=0, var_12_arg_1=2863311530, var_15=1, var_16=254, var_16_arg_0=1, var_17=0, var_17_arg_0=1, var_17_arg_1=254, var_22=0, var_26=0, var_26_arg_0=0, var_27=0, var_27_arg_0=0, var_28=0, var_28_arg_0=0, var_29=0, var_29_arg_0=0, var_29_arg_1=0, var_29_arg_2=0, var_31=0, var_31_arg_0=0, var_32=0, var_32_arg_0=0, var_33=0, var_33_arg_0=0, var_33_arg_1=0, var_33_arg_2=0, var_36=0, var_36_arg_0=0, var_38=0, var_38_arg_0=0, var_39=0, var_39_arg_0=0, var_39_arg_1=0, var_40=0, var_40_arg_0=0, var_41=0, var_41_arg_0=0, var_41_arg_1=0, var_41_arg_2=0, var_44=0, var_44_arg_0=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_46=0, var_46_arg_0=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_50=0, var_50_arg_0=0, var_52=0, var_52_arg_0=0, var_53=0, var_53_arg_0=0, var_53_arg_1=0, var_54=0, var_54_arg_0=0, var_55=0, var_55_arg_0=0, var_55_arg_1=0, var_55_arg_2=0, var_58=0, var_58_arg_0=0, var_59=0, var_59_arg_0=0, var_59_arg_1=0, var_60=0, var_60_arg_0=0, var_61=0, var_61_arg_0=0, var_61_arg_1=0, var_61_arg_2=0, var_64=0, var_64_arg_0=0, var_66=0, var_66_arg_0=0, var_67=0, var_67_arg_0=0, var_67_arg_1=0, var_68=0, var_68_arg_0=0, var_69=0, var_69_arg_0=0, var_69_arg_1=0, var_69_arg_2=0, var_72=0, var_72_arg_0=0, var_73=0, var_73_arg_0=0, var_73_arg_1=0, var_74=0, var_74_arg_0=0, var_75=0, var_75_arg_0=0, var_75_arg_1=0, var_75_arg_2=0, var_78=0, var_78_arg_0=0, var_79=0, var_79_arg_0=0, var_80=0, var_80_arg_0=0, var_80_arg_1=0, var_81=0, var_81_arg_0=0, var_82=0, var_82_arg_0=0, var_82_arg_1=0, var_82_arg_2=0, var_84=0, var_84_arg_0=0, var_84_arg_1=0, var_84_arg_2=0, var_86=0, var_86_arg_0=0, var_86_arg_1=0, var_88=2863311530, var_88_arg_0=0, var_88_arg_1=0, var_88_arg_2=2863311530, var_8=0] [L90] input_2 = __VERIFIER_nondet_uchar() [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_6 = __VERIFIER_nondet_uint() [L93] input_7 = __VERIFIER_nondet_uchar() [L94] input_7 = input_7 & mask_SORT_3 [L97] SORT_5 var_12_arg_0 = state_9; [L98] SORT_5 var_12_arg_1 = var_11; [L99] SORT_3 var_12 = var_12_arg_0 != var_12_arg_1; [L100] SORT_3 var_16_arg_0 = var_12; [L101] SORT_3 var_16 = ~var_16_arg_0; [L102] SORT_3 var_17_arg_0 = var_15; [L103] SORT_3 var_17_arg_1 = var_16; [L104] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L105] var_17 = var_17 & mask_SORT_3 [L106] SORT_3 bad_18_arg_0 = var_17; [L107] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L107] RET __VERIFIER_assert(!(bad_18_arg_0)) [L109] SORT_1 var_81_arg_0 = input_2; [L110] SORT_3 var_81 = var_81_arg_0 >> 4; [L111] var_81 = var_81 & mask_SORT_3 [L112] SORT_1 var_68_arg_0 = input_2; [L113] SORT_3 var_68 = var_68_arg_0 >> 3; [L114] var_68 = var_68 & mask_SORT_3 [L115] SORT_1 var_54_arg_0 = input_2; [L116] SORT_3 var_54 = var_54_arg_0 >> 2; [L117] var_54 = var_54 & mask_SORT_3 [L118] SORT_1 var_40_arg_0 = input_2; [L119] SORT_3 var_40 = var_40_arg_0 >> 1; [L120] var_40 = var_40 & mask_SORT_3 [L121] SORT_1 var_28_arg_0 = input_2; [L122] SORT_3 var_28 = var_28_arg_0 >> 0; [L123] var_28 = var_28 & mask_SORT_3 [L124] SORT_5 var_32_arg_0 = state_19; [L125] SORT_3 var_32 = var_32_arg_0 >> 0; [L126] SORT_5 var_31_arg_0 = state_19; [L127] SORT_3 var_31 = var_31_arg_0 >> 31; [L128] SORT_3 var_33_arg_0 = var_28; [L129] SORT_3 var_33_arg_1 = var_32; [L130] SORT_3 var_33_arg_2 = var_31; [L131] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L132] SORT_5 var_27_arg_0 = state_19; [L133] SORT_25 var_27 = var_27_arg_0 >> 1; [L134] SORT_5 var_26_arg_0 = state_19; [L135] SORT_25 var_26 = var_26_arg_0 >> 0; [L136] SORT_3 var_29_arg_0 = var_28; [L137] SORT_25 var_29_arg_1 = var_27; [L138] SORT_25 var_29_arg_2 = var_26; [L139] SORT_25 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L140] SORT_25 var_38_arg_0 = var_29; [L141] SORT_37 var_38 = var_38_arg_0 >> 2; [L142] var_38 = var_38 & mask_SORT_37 [L143] SORT_3 var_39_arg_0 = var_33; [L144] SORT_37 var_39_arg_1 = var_38; [L145] SORT_35 var_39 = ((SORT_35)var_39_arg_0 << 29) | var_39_arg_1; [L146] SORT_25 var_36_arg_0 = var_29; [L147] SORT_35 var_36 = var_36_arg_0 >> 0; [L148] SORT_3 var_41_arg_0 = var_40; [L149] SORT_35 var_41_arg_1 = var_39; [L150] SORT_35 var_41_arg_2 = var_36; [L151] SORT_35 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L152] SORT_35 var_60_arg_0 = var_41; [L153] SORT_57 var_60 = var_60_arg_0 >> 0; [L154] SORT_25 var_46_arg_0 = var_29; [L155] SORT_43 var_46 = var_46_arg_0 >> 0; [L156] SORT_25 var_44_arg_0 = var_29; [L157] SORT_3 var_44 = var_44_arg_0 >> 30; [L158] var_44 = var_44 & mask_SORT_3 [L159] SORT_3 var_45_arg_0 = var_33; [L160] SORT_3 var_45_arg_1 = var_44; [L161] SORT_43 var_45 = ((SORT_43)var_45_arg_0 << 1) | var_45_arg_1; [L162] SORT_3 var_47_arg_0 = var_40; [L163] SORT_43 var_47_arg_1 = var_46; [L164] SORT_43 var_47_arg_2 = var_45; [L165] SORT_43 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L166] SORT_35 var_58_arg_0 = var_41; [L167] SORT_43 var_58 = var_58_arg_0 >> 28; [L168] var_58 = var_58 & mask_SORT_43 [L169] SORT_43 var_59_arg_0 = var_47; [L170] SORT_43 var_59_arg_1 = var_58; [L171] SORT_57 var_59 = ((SORT_57)var_59_arg_0 << 2) | var_59_arg_1; [L172] SORT_3 var_61_arg_0 = var_54; [L173] SORT_57 var_61_arg_1 = var_60; [L174] SORT_57 var_61_arg_2 = var_59; [L175] SORT_57 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L176] SORT_35 var_52_arg_0 = var_41; [L177] SORT_51 var_52 = var_52_arg_0 >> 4; [L178] var_52 = var_52 & mask_SORT_51 [L179] SORT_43 var_53_arg_0 = var_47; [L180] SORT_51 var_53_arg_1 = var_52; [L181] SORT_49 var_53 = ((SORT_49)var_53_arg_0 << 26) | var_53_arg_1; [L182] SORT_35 var_50_arg_0 = var_41; [L183] SORT_49 var_50 = var_50_arg_0 >> 0; [L184] SORT_3 var_55_arg_0 = var_54; [L185] SORT_49 var_55_arg_1 = var_53; [L186] SORT_49 var_55_arg_2 = var_50; [L187] SORT_49 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L188] SORT_49 var_66_arg_0 = var_55; [L189] SORT_65 var_66 = var_66_arg_0 >> 8; [L190] var_66 = var_66 & mask_SORT_65 [L191] SORT_57 var_67_arg_0 = var_61; [L192] SORT_65 var_67_arg_1 = var_66; [L193] SORT_63 var_67 = ((SORT_63)var_67_arg_0 << 20) | var_67_arg_1; [L194] SORT_49 var_64_arg_0 = var_55; [L195] SORT_63 var_64 = var_64_arg_0 >> 0; [L196] SORT_3 var_69_arg_0 = var_68; [L197] SORT_63 var_69_arg_1 = var_67; [L198] SORT_63 var_69_arg_2 = var_64; [L199] SORT_63 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L200] SORT_63 var_78_arg_0 = var_69; [L201] SORT_77 var_78 = var_78_arg_0 >> 0; [L202] SORT_49 var_74_arg_0 = var_55; [L203] SORT_71 var_74 = var_74_arg_0 >> 0; [L204] SORT_49 var_72_arg_0 = var_55; [L205] SORT_57 var_72 = var_72_arg_0 >> 24; [L206] var_72 = var_72 & mask_SORT_57 [L207] SORT_57 var_73_arg_0 = var_61; [L208] SORT_57 var_73_arg_1 = var_72; [L209] SORT_71 var_73 = ((SORT_71)var_73_arg_0 << 4) | var_73_arg_1; [L210] SORT_3 var_75_arg_0 = var_68; [L211] SORT_71 var_75_arg_1 = var_74; [L212] SORT_71 var_75_arg_2 = var_73; [L213] SORT_71 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L214] SORT_63 var_79_arg_0 = var_69; [L215] SORT_71 var_79 = var_79_arg_0 >> 16; [L216] var_79 = var_79 & mask_SORT_71 [L217] SORT_71 var_80_arg_0 = var_75; [L218] SORT_71 var_80_arg_1 = var_79; [L219] SORT_77 var_80 = ((SORT_77)var_80_arg_0 << 8) | var_80_arg_1; [L220] SORT_3 var_84_arg_0 = var_81; [L221] SORT_77 var_84_arg_1 = var_78; [L222] SORT_77 var_84_arg_2 = var_80; [L223] SORT_77 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L224] SORT_3 var_82_arg_0 = var_81; [L225] SORT_77 var_82_arg_1 = var_80; [L226] SORT_77 var_82_arg_2 = var_78; [L227] SORT_77 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L228] var_82 = var_82 & mask_SORT_77 [L229] SORT_77 var_86_arg_0 = var_84; [L230] SORT_77 var_86_arg_1 = var_82; [L231] SORT_5 var_86 = ((SORT_5)var_86_arg_0 << 16) | var_86_arg_1; [L232] var_86 = var_86 & mask_SORT_5 [L233] SORT_5 next_87_arg_1 = var_86; [L234] SORT_3 var_88_arg_0 = state_23; [L235] SORT_5 var_88_arg_1 = state_9; [L236] SORT_5 var_88_arg_2 = input_6; [L237] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L238] SORT_5 next_89_arg_1 = var_88; [L239] SORT_3 next_90_arg_1 = input_7; [L241] state_9 = next_87_arg_1 [L242] state_19 = next_89_arg_1 [L243] state_23 = next_90_arg_1 VAL [bad_18_arg_0=0, init_10_arg_1=0, init_20_arg_1=0, init_24_arg_1=0, input_2=24, input_6=0, input_7=0, mask_SORT_1=31, mask_SORT_25=2147483647, mask_SORT_35=1073741823, mask_SORT_37=536870911, mask_SORT_3=1, mask_SORT_43=3, mask_SORT_49=268435455, mask_SORT_51=67108863, mask_SORT_57=15, mask_SORT_5=4294967295, mask_SORT_63=16777215, mask_SORT_65=1048575, mask_SORT_71=255, mask_SORT_77=65535, msb_SORT_1=16, msb_SORT_25=1073741824, msb_SORT_35=536870912, msb_SORT_37=268435456, msb_SORT_3=1, msb_SORT_43=2, msb_SORT_49=134217728, msb_SORT_51=33554432, msb_SORT_57=8, msb_SORT_5=2147483648, msb_SORT_63=8388608, msb_SORT_65=524288, msb_SORT_71=128, msb_SORT_77=32768, next_87_arg_1=2863311530, next_89_arg_1=0, next_90_arg_1=0, state_19=0, state_23=0, state_9=2863311530, var_11=2863311530, var_12=1, var_12_arg_0=0, var_12_arg_1=2863311530, var_15=1, var_16=254, var_16_arg_0=1, var_17=0, var_17_arg_0=1, var_17_arg_1=254, var_22=0, var_26=2863311530, var_26_arg_0=2863311530, var_27=1431655765, var_27_arg_0=2863311530, var_28=0, var_28_arg_0=24, var_29=2863311530, var_29_arg_0=0, var_29_arg_1=1431655765, var_29_arg_2=2863311530, var_31=1, var_31_arg_0=2863311530, var_32=170, var_32_arg_0=2863311530, var_33=1, var_33_arg_0=0, var_33_arg_1=170, var_33_arg_2=1, var_36=2863311530, var_36_arg_0=2863311530, var_38=178956970, var_38_arg_0=2863311530, var_39=715827882, var_39_arg_0=1, var_39_arg_1=178956970, var_40=0, var_40_arg_0=24, var_41=2863311530, var_41_arg_0=0, var_41_arg_1=715827882, var_41_arg_2=2863311530, var_44=0, var_44_arg_0=2863311530, var_45=2, var_45_arg_0=1, var_45_arg_1=0, var_46=170, var_46_arg_0=2863311530, var_47=2, var_47_arg_0=0, var_47_arg_1=170, var_47_arg_2=2, var_50=2863311530, var_50_arg_0=2863311530, var_52=44739242, var_52_arg_0=2863311530, var_53=178956970, var_53_arg_0=2, var_53_arg_1=44739242, var_54=0, var_54_arg_0=24, var_55=2863311530, var_55_arg_0=0, var_55_arg_1=178956970, var_55_arg_2=2863311530, var_58=2, var_58_arg_0=2863311530, var_59=10, var_59_arg_0=2, var_59_arg_1=2, var_60=170, var_60_arg_0=2863311530, var_61=10, var_61_arg_0=0, var_61_arg_1=170, var_61_arg_2=10, var_64=2863311530, var_64_arg_0=2863311530, var_66=699050, var_66_arg_0=2863311530, var_67=11184810, var_67_arg_0=10, var_67_arg_1=699050, var_68=1, var_68_arg_0=24, var_69=11184810, var_69_arg_0=1, var_69_arg_1=11184810, var_69_arg_2=2863311530, var_72=10, var_72_arg_0=2863311530, var_73=170, var_73_arg_0=10, var_73_arg_1=10, var_74=170, var_74_arg_0=2863311530, var_75=170, var_75_arg_0=1, var_75_arg_1=170, var_75_arg_2=170, var_78=43690, var_78_arg_0=11184810, var_79=170, var_79_arg_0=11184810, var_80=43690, var_80_arg_0=170, var_80_arg_1=170, var_81=1, var_81_arg_0=24, var_82=43690, var_82_arg_0=1, var_82_arg_1=43690, var_82_arg_2=43690, var_84=43690, var_84_arg_0=1, var_84_arg_1=43690, var_84_arg_2=43690, var_86=2863311530, var_86_arg_0=43690, var_86_arg_1=43690, var_88=0, var_88_arg_0=0, var_88_arg_1=0, var_88_arg_2=0, var_8=0] [L90] input_2 = __VERIFIER_nondet_uchar() [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_6 = __VERIFIER_nondet_uint() [L93] input_7 = __VERIFIER_nondet_uchar() [L94] input_7 = input_7 & mask_SORT_3 [L97] SORT_5 var_12_arg_0 = state_9; [L98] SORT_5 var_12_arg_1 = var_11; [L99] SORT_3 var_12 = var_12_arg_0 != var_12_arg_1; [L100] SORT_3 var_16_arg_0 = var_12; [L101] SORT_3 var_16 = ~var_16_arg_0; [L102] SORT_3 var_17_arg_0 = var_15; [L103] SORT_3 var_17_arg_1 = var_16; [L104] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L105] var_17 = var_17 & mask_SORT_3 [L106] SORT_3 bad_18_arg_0 = var_17; [L107] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 4 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 5 QuantifiedInterpolants, 43810 SizeOfPredicates, 117 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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! [2023-12-16 22:36:27,793 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...