/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_rotate32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 22:35:54,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 22:35:54,098 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:35:54,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 22:35:54,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 22:35:54,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 22:35:54,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 22:35:54,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 22:35:54,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 22:35:54,131 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 22:35:54,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 22:35:54,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 22:35:54,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 22:35:54,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 22:35:54,133 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 22:35:54,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 22:35:54,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 22:35:54,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 22:35:54,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 22:35:54,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 22:35:54,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 22:35:54,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 22:35:54,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 22:35:54,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 22:35:54,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 22:35:54,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 22:35:54,136 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 22:35:54,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 22:35:54,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 22:35:54,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 22:35:54,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 22:35:54,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:35:54,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 22:35:54,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 22:35:54,138 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 22:35:54,138 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:35:54,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 22:35:54,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 22:35:54,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 22:35:54,345 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 22:35:54,345 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 22:35:54,345 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_rotate32.c [2023-12-16 22:35:55,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 22:35:55,505 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 22:35:55,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2023-12-16 22:35:55,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fcc55cc/814293894d604aa2bb2dd97872bab055/FLAGa0d23616c [2023-12-16 22:35:55,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fcc55cc/814293894d604aa2bb2dd97872bab055 [2023-12-16 22:35:55,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 22:35:55,522 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 22:35:55,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 22:35:55,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 22:35:55,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 22:35:55,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcd7f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55, skipping insertion in model container [2023-12-16 22:35:55,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,560 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 22:35:55,674 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_rotate32.c[1258,1271] [2023-12-16 22:35:55,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:35:55,726 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 22:35:55,733 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_rotate32.c[1258,1271] [2023-12-16 22:35:55,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:35:55,780 INFO L206 MainTranslator]: Completed translation [2023-12-16 22:35:55,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55 WrapperNode [2023-12-16 22:35:55,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 22:35:55,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 22:35:55,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 22:35:55,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 22:35:55,786 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:35:55" (1/1) ... [2023-12-16 22:35:55,803 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:35:55" (1/1) ... [2023-12-16 22:35:55,820 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2023-12-16 22:35:55,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 22:35:55,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 22:35:55,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 22:35:55,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 22:35:55,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,839 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:35:55,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 22:35:55,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 22:35:55,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 22:35:55,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 22:35:55,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (1/1) ... [2023-12-16 22:35:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:35:55,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 22:35:55,873 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:35:55,882 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:35:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 22:35:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 22:35:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 22:35:55,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 22:35:55,998 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 22:35:55,999 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 22:35:56,203 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 22:35:56,250 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 22:35:56,250 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 22:35:56,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:35:56 BoogieIcfgContainer [2023-12-16 22:35:56,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 22:35:56,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 22:35:56,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 22:35:56,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 22:35:56,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 10:35:55" (1/3) ... [2023-12-16 22:35:56,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421c7903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:35:56, skipping insertion in model container [2023-12-16 22:35:56,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:35:55" (2/3) ... [2023-12-16 22:35:56,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421c7903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:35:56, skipping insertion in model container [2023-12-16 22:35:56,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:35:56" (3/3) ... [2023-12-16 22:35:56,256 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2023-12-16 22:35:56,267 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 22:35:56,268 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 22:35:56,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 22:35:56,300 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;@75f8c5a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 22:35:56,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 22:35:56,304 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:35:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 22:35:56,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:35:56,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 22:35:56,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:35:56,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:35:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 22:35:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:35:56,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748351580] [2023-12-16 22:35:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:35:56,328 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:35:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:35:56,353 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:35:56,358 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:35:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:35:56,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 22:35:56,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:35:56,602 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:35:56,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 22:35:56,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:35:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748351580] [2023-12-16 22:35:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748351580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 22:35:56,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 22:35:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 22:35:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855455870] [2023-12-16 22:35:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 22:35:56,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 22:35:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:35:56,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 22:35:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 22:35:56,636 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:35:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:35:56,681 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 22:35:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 22:35:56,684 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:35:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:35:56,688 INFO L225 Difference]: With dead ends: 16 [2023-12-16 22:35:56,688 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 22:35:56,690 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:35:56,693 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:35:56,694 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:35:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 22:35:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 22:35:56,717 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:35:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 22:35:56,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 22:35:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:35:56,718 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 22:35:56,719 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:35:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 22:35:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 22:35:56,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:35:56,719 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 22:35:56,728 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:35:56,923 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:35:56,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:35:56,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:35:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 22:35:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:35:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779466142] [2023-12-16 22:35:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:35:56,926 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:35:56,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:35:56,927 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:35:56,928 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:35:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:35:57,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-16 22:35:57,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:35:57,812 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:35:57,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:35:59,128 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:35:59,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:35:59,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779466142] [2023-12-16 22:35:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779466142] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:35:59,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:35:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 22:35:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651485629] [2023-12-16 22:35:59,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:35:59,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 22:35:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:35:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 22:35:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 22:35:59,131 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:35:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:35:59,435 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-16 22:35:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 22:35:59,436 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:35:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:35:59,436 INFO L225 Difference]: With dead ends: 14 [2023-12-16 22:35:59,436 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 22:35:59,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-16 22:35:59,437 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 22:35:59,438 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.1s Time] [2023-12-16 22:35:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 22:35:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-16 22:35:59,440 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:35:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-16 22:35:59,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-16 22:35:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:35:59,441 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-16 22:35:59,441 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:35:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-16 22:35:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 22:35:59,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:35:59,441 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-16 22:35:59,446 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 (3)] Forceful destruction successful, exit code 0 [2023-12-16 22:35:59,644 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:35:59,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:35:59,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:35:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-16 22:35:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:35:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86850680] [2023-12-16 22:35:59,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 22:35:59,646 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:35:59,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:35:59,647 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:35:59,648 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:35:59,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 22:35:59,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 22:35:59,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 22:35:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 22:35:59,899 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 22:35:59,900 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 22:35:59,900 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 22:35:59,912 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:00,102 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:00,104 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-12-16 22:36:00,107 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 22:36:00,134 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:36:00,135 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:36:00,135 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:36:00,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 10:36:00 BoogieIcfgContainer [2023-12-16 22:36:00,143 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 22:36:00,143 INFO L158 Benchmark]: Toolchain (without parser) took 4620.73ms. Allocated memory was 197.1MB in the beginning and 352.3MB in the end (delta: 155.2MB). Free memory was 148.9MB in the beginning and 234.0MB in the end (delta: -85.1MB). Peak memory consumption was 71.5MB. Max. memory is 8.0GB. [2023-12-16 22:36:00,143 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 197.1MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 22:36:00,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.96ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 133.3MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 22:36:00,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.77ms. Allocated memory is still 197.1MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 22:36:00,144 INFO L158 Benchmark]: Boogie Preprocessor took 26.78ms. Allocated memory is still 197.1MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 22:36:00,145 INFO L158 Benchmark]: RCFGBuilder took 402.64ms. Allocated memory is still 197.1MB. Free memory was 128.4MB in the beginning and 166.2MB in the end (delta: -37.8MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2023-12-16 22:36:00,145 INFO L158 Benchmark]: TraceAbstraction took 3890.72ms. Allocated memory was 197.1MB in the beginning and 352.3MB in the end (delta: 155.2MB). Free memory was 165.3MB in the beginning and 234.0MB in the end (delta: -68.7MB). Peak memory consumption was 86.5MB. Max. memory is 8.0GB. [2023-12-16 22:36:00,146 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.08ms. Allocated memory is still 197.1MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.96ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 133.3MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.77ms. Allocated memory is still 197.1MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.78ms. Allocated memory is still 197.1MB. Free memory was 131.0MB in the beginning and 128.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 402.64ms. Allocated memory is still 197.1MB. Free memory was 128.4MB in the beginning and 166.2MB in the end (delta: -37.8MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3890.72ms. Allocated memory was 197.1MB in the beginning and 352.3MB in the end (delta: 155.2MB). Free memory was 165.3MB in the beginning and 234.0MB in the end (delta: -68.7MB). Peak memory consumption was 86.5MB. 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_22 mask_SORT_22 = (SORT_22)-1 >> (sizeof(SORT_22) * 8 - 31); [L36] const SORT_22 msb_SORT_22 = (SORT_22)1 << (31 - 1); [L38] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 30); [L39] const SORT_29 msb_SORT_29 = (SORT_29)1 << (30 - 1); [L41] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 2); [L42] const SORT_31 msb_SORT_31 = (SORT_31)1 << (2 - 1); [L44] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 28); [L45] const SORT_37 msb_SORT_37 = (SORT_37)1 << (28 - 1); [L47] const SORT_39 mask_SORT_39 = (SORT_39)-1 >> (sizeof(SORT_39) * 8 - 4); [L48] const SORT_39 msb_SORT_39 = (SORT_39)1 << (4 - 1); [L50] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 24); [L51] const SORT_45 msb_SORT_45 = (SORT_45)1 << (24 - 1); [L53] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 8); [L54] const SORT_47 msb_SORT_47 = (SORT_47)1 << (8 - 1); [L56] const SORT_53 mask_SORT_53 = (SORT_53)-1 >> (sizeof(SORT_53) * 8 - 16); [L57] const SORT_53 msb_SORT_53 = (SORT_53)1 << (16 - 1); [L59] const SORT_5 var_7 = 0; [L60] const SORT_5 var_10 = 2863311530; [L61] const SORT_3 var_15 = 1; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L67] SORT_5 state_8 = __VERIFIER_nondet_uint() & mask_SORT_5; [L68] SORT_5 state_19 = __VERIFIER_nondet_uint() & mask_SORT_5; [L70] SORT_5 init_9_arg_1 = var_7; [L71] state_8 = init_9_arg_1 [L72] SORT_5 init_20_arg_1 = var_7; [L73] state_19 = init_20_arg_1 VAL [init_20_arg_1=0, init_9_arg_1=0, mask_SORT_1=31, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_31=3, mask_SORT_37=268435455, mask_SORT_39=15, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_47=255, mask_SORT_53=65535, mask_SORT_5=4294967295, msb_SORT_1=16, msb_SORT_22=1073741824, msb_SORT_29=536870912, msb_SORT_31=2, msb_SORT_37=134217728, msb_SORT_39=8, msb_SORT_3=1, msb_SORT_45=8388608, msb_SORT_47=128, msb_SORT_53=32768, msb_SORT_5=2147483648, state_19=0, state_8=0, var_10=2863311530, var_15=1, var_7=0] [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 VAL [bad_18_arg_0=0, init_20_arg_1=0, init_9_arg_1=0, input_2=0, input_6=2863311530, mask_SORT_1=31, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_31=3, mask_SORT_37=268435455, mask_SORT_39=15, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_47=255, mask_SORT_53=65535, mask_SORT_5=4294967295, msb_SORT_1=16, msb_SORT_22=1073741824, msb_SORT_29=536870912, msb_SORT_31=2, msb_SORT_37=134217728, msb_SORT_39=8, msb_SORT_3=1, msb_SORT_45=8388608, msb_SORT_47=128, msb_SORT_53=32768, msb_SORT_5=2147483648, next_60_arg_1=0, next_61_arg_1=2863311530, state_19=2863311530, state_8=0, var_10=2863311530, var_11=0, var_11_arg_0=0, var_11_arg_1=2863311530, var_12=255, var_12_arg_0=0, var_15=1, var_16=0, var_16_arg_0=255, var_17=0, var_17_arg_0=1, var_17_arg_1=0, var_23=0, var_23_arg_0=0, var_24=0, var_24_arg_0=0, var_25=0, var_25_arg_0=0, var_25_arg_1=0, var_26=0, var_26_arg_0=0, var_27=0, var_27_arg_0=0, var_27_arg_1=0, var_27_arg_2=0, var_30=0, var_30_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_34=0, var_34_arg_0=0, var_35=0, var_35_arg_0=0, var_35_arg_1=0, var_35_arg_2=0, var_38=0, var_38_arg_0=0, var_40=0, var_40_arg_0=0, var_41=0, var_41_arg_0=0, var_41_arg_1=0, var_42=0, var_42_arg_0=0, var_43=0, var_43_arg_0=0, var_43_arg_1=0, var_43_arg_2=0, var_46=0, var_46_arg_0=0, var_48=0, var_48_arg_0=0, var_49=0, var_49_arg_0=0, var_49_arg_1=0, var_50=0, var_50_arg_0=0, var_51=0, var_51_arg_0=0, var_51_arg_1=0, var_51_arg_2=0, var_54=0, var_54_arg_0=0, var_55=0, var_55_arg_0=0, var_56=0, var_56_arg_0=0, var_56_arg_1=0, var_57=0, var_57_arg_0=0, var_58=0, var_58_arg_0=0, var_58_arg_1=0, var_58_arg_2=0, var_7=0] [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; [L93] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L93] RET __VERIFIER_assert(!(bad_18_arg_0)) [L95] SORT_1 var_57_arg_0 = input_2; [L96] SORT_3 var_57 = var_57_arg_0 >> 4; [L97] var_57 = var_57 & mask_SORT_3 [L98] SORT_1 var_50_arg_0 = input_2; [L99] SORT_3 var_50 = var_50_arg_0 >> 3; [L100] var_50 = var_50 & mask_SORT_3 [L101] SORT_1 var_42_arg_0 = input_2; [L102] SORT_3 var_42 = var_42_arg_0 >> 2; [L103] var_42 = var_42 & mask_SORT_3 [L104] SORT_1 var_34_arg_0 = input_2; [L105] SORT_3 var_34 = var_34_arg_0 >> 1; [L106] var_34 = var_34 & mask_SORT_3 [L107] SORT_1 var_26_arg_0 = input_2; [L108] SORT_3 var_26 = var_26_arg_0 >> 0; [L109] var_26 = var_26 & mask_SORT_3 [L110] SORT_5 var_24_arg_0 = state_19; [L111] SORT_3 var_24 = var_24_arg_0 >> 0; [L112] SORT_5 var_23_arg_0 = state_19; [L113] SORT_22 var_23 = var_23_arg_0 >> 1; [L114] var_23 = var_23 & mask_SORT_22 [L115] SORT_3 var_25_arg_0 = var_24; [L116] SORT_22 var_25_arg_1 = var_23; [L117] SORT_5 var_25 = ((SORT_5)var_25_arg_0 << 31) | var_25_arg_1; [L118] SORT_3 var_27_arg_0 = var_26; [L119] SORT_5 var_27_arg_1 = var_25; [L120] SORT_5 var_27_arg_2 = state_19; [L121] SORT_5 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L122] SORT_5 var_32_arg_0 = var_27; [L123] SORT_31 var_32 = var_32_arg_0 >> 0; [L124] SORT_5 var_30_arg_0 = var_27; [L125] SORT_29 var_30 = var_30_arg_0 >> 2; [L126] var_30 = var_30 & mask_SORT_29 [L127] SORT_31 var_33_arg_0 = var_32; [L128] SORT_29 var_33_arg_1 = var_30; [L129] SORT_5 var_33 = ((SORT_5)var_33_arg_0 << 30) | var_33_arg_1; [L130] SORT_3 var_35_arg_0 = var_34; [L131] SORT_5 var_35_arg_1 = var_33; [L132] SORT_5 var_35_arg_2 = var_27; [L133] SORT_5 var_35 = var_35_arg_0 ? var_35_arg_1 : var_35_arg_2; [L134] SORT_5 var_40_arg_0 = var_35; [L135] SORT_39 var_40 = var_40_arg_0 >> 0; [L136] SORT_5 var_38_arg_0 = var_35; [L137] SORT_37 var_38 = var_38_arg_0 >> 4; [L138] var_38 = var_38 & mask_SORT_37 [L139] SORT_39 var_41_arg_0 = var_40; [L140] SORT_37 var_41_arg_1 = var_38; [L141] SORT_5 var_41 = ((SORT_5)var_41_arg_0 << 28) | var_41_arg_1; [L142] SORT_3 var_43_arg_0 = var_42; [L143] SORT_5 var_43_arg_1 = var_41; [L144] SORT_5 var_43_arg_2 = var_35; [L145] SORT_5 var_43 = var_43_arg_0 ? var_43_arg_1 : var_43_arg_2; [L146] SORT_5 var_48_arg_0 = var_43; [L147] SORT_47 var_48 = var_48_arg_0 >> 0; [L148] SORT_5 var_46_arg_0 = var_43; [L149] SORT_45 var_46 = var_46_arg_0 >> 8; [L150] var_46 = var_46 & mask_SORT_45 [L151] SORT_47 var_49_arg_0 = var_48; [L152] SORT_45 var_49_arg_1 = var_46; [L153] SORT_5 var_49 = ((SORT_5)var_49_arg_0 << 24) | var_49_arg_1; [L154] SORT_3 var_51_arg_0 = var_50; [L155] SORT_5 var_51_arg_1 = var_49; [L156] SORT_5 var_51_arg_2 = var_43; [L157] SORT_5 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L158] SORT_5 var_55_arg_0 = var_51; [L159] SORT_53 var_55 = var_55_arg_0 >> 0; [L160] SORT_5 var_54_arg_0 = var_51; [L161] SORT_53 var_54 = var_54_arg_0 >> 16; [L162] var_54 = var_54 & mask_SORT_53 [L163] SORT_53 var_56_arg_0 = var_55; [L164] SORT_53 var_56_arg_1 = var_54; [L165] SORT_5 var_56 = ((SORT_5)var_56_arg_0 << 16) | var_56_arg_1; [L166] SORT_3 var_58_arg_0 = var_57; [L167] SORT_5 var_58_arg_1 = var_56; [L168] SORT_5 var_58_arg_2 = var_51; [L169] SORT_5 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L170] var_58 = var_58 & mask_SORT_5 [L171] SORT_5 next_60_arg_1 = var_58; [L172] SORT_5 next_61_arg_1 = input_6; [L174] state_8 = next_60_arg_1 [L175] state_19 = next_61_arg_1 VAL [bad_18_arg_0=0, init_20_arg_1=0, init_9_arg_1=0, input_2=14, input_6=5, mask_SORT_1=31, mask_SORT_22=2147483647, mask_SORT_29=1073741823, mask_SORT_31=3, mask_SORT_37=268435455, mask_SORT_39=15, mask_SORT_3=1, mask_SORT_45=16777215, mask_SORT_47=255, mask_SORT_53=65535, mask_SORT_5=4294967295, msb_SORT_1=16, msb_SORT_22=1073741824, msb_SORT_29=536870912, msb_SORT_31=2, msb_SORT_37=134217728, msb_SORT_39=8, msb_SORT_3=1, msb_SORT_45=8388608, msb_SORT_47=128, msb_SORT_53=32768, msb_SORT_5=2147483648, next_60_arg_1=2863311530, next_61_arg_1=5, state_19=5, state_8=2863311530, var_10=2863311530, var_11=0, var_11_arg_0=0, var_11_arg_1=2863311530, var_12=255, var_12_arg_0=0, var_15=1, var_16=0, var_16_arg_0=255, var_17=0, var_17_arg_0=1, var_17_arg_1=0, var_23=1431655765, var_23_arg_0=2863311530, var_24=170, var_24_arg_0=2863311530, var_25=1431655765, var_25_arg_0=170, var_25_arg_1=1431655765, var_26=0, var_26_arg_0=14, var_27=2863311530, var_27_arg_0=0, var_27_arg_1=1431655765, var_27_arg_2=2863311530, var_30=715827882, var_30_arg_0=2863311530, var_32=170, var_32_arg_0=2863311530, var_33=2863311530, var_33_arg_0=170, var_33_arg_1=715827882, var_34=1, var_34_arg_0=14, var_35=2863311530, var_35_arg_0=1, var_35_arg_1=2863311530, var_35_arg_2=2863311530, var_38=178956970, var_38_arg_0=2863311530, var_40=170, var_40_arg_0=2863311530, var_41=2863311530, var_41_arg_0=170, var_41_arg_1=178956970, var_42=1, var_42_arg_0=14, var_43=2863311530, var_43_arg_0=1, var_43_arg_1=2863311530, var_43_arg_2=2863311530, var_46=11184810, var_46_arg_0=2863311530, var_48=170, var_48_arg_0=2863311530, var_49=2863311530, var_49_arg_0=170, var_49_arg_1=11184810, var_50=1, var_50_arg_0=14, var_51=2863311530, var_51_arg_0=1, var_51_arg_1=2863311530, var_51_arg_2=2863311530, var_54=43690, var_54_arg_0=2863311530, var_55=43690, var_55_arg_0=2863311530, var_56=2863311530, var_56_arg_0=43690, var_56_arg_1=43690, var_57=0, var_57_arg_0=14, var_58=2863311530, var_58_arg_0=0, var_58_arg_1=2863311530, var_58_arg_2=2863311530, var_7=0] [L76] input_2 = __VERIFIER_nondet_uchar() [L77] input_4 = __VERIFIER_nondet_uchar() [L78] input_6 = __VERIFIER_nondet_uint() [L81] SORT_5 var_11_arg_0 = state_8; [L82] SORT_5 var_11_arg_1 = var_10; [L83] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L84] SORT_3 var_12_arg_0 = var_11; [L85] SORT_3 var_12 = ~var_12_arg_0; [L86] SORT_3 var_16_arg_0 = var_12; [L87] SORT_3 var_16 = ~var_16_arg_0; [L88] SORT_3 var_17_arg_0 = var_15; [L89] SORT_3 var_17_arg_1 = var_16; [L90] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L91] var_17 = var_17 & mask_SORT_3 [L92] SORT_3 bad_18_arg_0 = var_17; [L93] 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: 3.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.1s 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, 0.9s 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.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 5 QuantifiedInterpolants, 4877 SizeOfPredicates, 96 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 86 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:00,170 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...