/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.mul5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 22:06:59,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 22:06:59,433 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:06:59,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 22:06:59,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 22:06:59,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 22:06:59,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 22:06:59,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 22:06:59,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 22:06:59,470 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 22:06:59,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 22:06:59,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 22:06:59,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 22:06:59,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 22:06:59,471 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 22:06:59,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 22:06:59,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 22:06:59,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 22:06:59,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 22:06:59,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 22:06:59,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 22:06:59,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 22:06:59,480 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 22:06:59,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 22:06:59,480 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 22:06:59,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 22:06:59,481 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 22:06:59,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 22:06:59,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 22:06:59,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 22:06:59,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 22:06:59,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:06:59,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 22:06:59,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 22:06:59,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 22:06:59,484 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 22:06:59,484 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 22:06:59,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 22:06:59,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 22:06:59,485 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 22:06:59,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 22:06:59,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 22:06:59,485 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 22:06:59,485 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:06:59,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 22:06:59,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 22:06:59,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 22:06:59,742 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 22:06:59,742 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 22:06:59,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c [2023-12-16 22:07:00,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 22:07:01,065 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 22:07:01,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul5.c [2023-12-16 22:07:01,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e2c42de/f152364510ac4ecfa5c9855242d6e111/FLAG92dc2c354 [2023-12-16 22:07:01,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e2c42de/f152364510ac4ecfa5c9855242d6e111 [2023-12-16 22:07:01,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 22:07:01,090 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 22:07:01,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 22:07:01,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 22:07:01,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 22:07:01,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e56470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01, skipping insertion in model container [2023-12-16 22:07:01,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,134 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 22:07:01,260 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.mul5.c[1244,1257] [2023-12-16 22:07:01,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:07:01,325 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 22:07:01,336 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.mul5.c[1244,1257] [2023-12-16 22:07:01,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:07:01,416 INFO L206 MainTranslator]: Completed translation [2023-12-16 22:07:01,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01 WrapperNode [2023-12-16 22:07:01,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 22:07:01,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 22:07:01,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 22:07:01,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 22:07:01,424 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:07:01" (1/1) ... [2023-12-16 22:07:01,434 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:07:01" (1/1) ... [2023-12-16 22:07:01,462 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 271 [2023-12-16 22:07:01,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 22:07:01,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 22:07:01,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 22:07:01,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 22:07:01,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,509 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2023-12-16 22:07:01,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 22:07:01,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 22:07:01,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 22:07:01,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 22:07:01,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (1/1) ... [2023-12-16 22:07:01,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:07:01,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 22:07:01,572 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:07:01,575 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:07:01,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 22:07:01,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 22:07:01,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 22:07:01,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 22:07:01,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 22:07:01,709 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 22:07:01,711 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 22:07:02,067 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 22:07:02,099 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 22:07:02,100 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 22:07:02,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:07:02 BoogieIcfgContainer [2023-12-16 22:07:02,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 22:07:02,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 22:07:02,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 22:07:02,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 22:07:02,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 10:07:01" (1/3) ... [2023-12-16 22:07:02,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1fcd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:07:02, skipping insertion in model container [2023-12-16 22:07:02,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:07:01" (2/3) ... [2023-12-16 22:07:02,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1fcd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:07:02, skipping insertion in model container [2023-12-16 22:07:02,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:07:02" (3/3) ... [2023-12-16 22:07:02,107 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul5.c [2023-12-16 22:07:02,122 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 22:07:02,122 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 22:07:02,207 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 22:07:02,212 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;@228e6ba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 22:07:02,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 22:07:02,221 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:07:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 22:07:02,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:07:02,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 22:07:02,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:07:02,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:07:02,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 22:07:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:07:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553668142] [2023-12-16 22:07:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:07:02,243 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:07:02,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:07:02,245 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:07:02,247 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:07:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:07:02,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 22:07:02,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:07:02,589 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:07:02,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 22:07:02,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:07:02,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553668142] [2023-12-16 22:07:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553668142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 22:07:02,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 22:07:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 22:07:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136111328] [2023-12-16 22:07:02,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 22:07:02,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 22:07:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:07:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 22:07:02,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 22:07:02,626 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:07:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:07:02,939 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 22:07:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 22:07:02,941 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:07:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:07:02,946 INFO L225 Difference]: With dead ends: 16 [2023-12-16 22:07:02,947 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 22:07:02,949 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:07:02,953 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2023-12-16 22:07:02,955 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.3s Time] [2023-12-16 22:07:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 22:07:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 22:07:02,983 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:07:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 22:07:02,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 22:07:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:07:02,985 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 22:07:02,985 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:07:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 22:07:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 22:07:02,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:07:02,986 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 22:07:02,992 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 (2)] Forceful destruction successful, exit code 0 [2023-12-16 22:07:03,188 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:07:03,189 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:07:03,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:07:03,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 22:07:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:07:03,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54794061] [2023-12-16 22:07:03,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:07:03,192 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:07:03,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:07:03,193 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:07:03,194 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:07:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:07:03,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-16 22:07:03,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:07:03,636 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:07:03,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:07:04,113 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:07:04,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:07:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54794061] [2023-12-16 22:07:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54794061] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:07:04,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:07:04,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 22:07:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885367624] [2023-12-16 22:07:04,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:07:04,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 22:07:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:07:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 22:07:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 22:07:04,119 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:07:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:07:04,980 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-16 22:07:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 22:07:04,981 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:07:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:07:04,981 INFO L225 Difference]: With dead ends: 14 [2023-12-16 22:07:04,981 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 22:07:04,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-16 22:07:04,983 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-12-16 22:07:04,983 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.8s Time] [2023-12-16 22:07:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 22:07:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-16 22:07:04,986 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:07:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-16 22:07:04,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-16 22:07:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:07:04,987 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-16 22:07:04,987 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:07:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-16 22:07:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 22:07:04,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:07:04,988 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-16 22:07:05,000 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:07:05,199 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:07:05,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:07:05,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:07:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-16 22:07:05,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:07:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582662101] [2023-12-16 22:07:05,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 22:07:05,201 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:07:05,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:07:05,203 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:07:05,203 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:07:05,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 22:07:05,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 22:07:05,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 22:07:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 22:07:06,489 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 22:07:06,489 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 22:07:06,492 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 22:07:06,519 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:07:06,694 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:07:06,697 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-12-16 22:07:06,700 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 22:07:06,742 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:07:06,742 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:07:06,742 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:07:06,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 10:07:06 BoogieIcfgContainer [2023-12-16 22:07:06,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 22:07:06,763 INFO L158 Benchmark]: Toolchain (without parser) took 5673.26ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 142.1MB in the beginning and 218.6MB in the end (delta: -76.5MB). Peak memory consumption was 88.0MB. Max. memory is 8.0GB. [2023-12-16 22:07:06,763 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 187.7MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 22:07:06,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.11ms. Allocated memory is still 187.7MB. Free memory was 142.1MB in the beginning and 125.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 22:07:06,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.81ms. Allocated memory is still 187.7MB. Free memory was 125.3MB in the beginning and 122.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 22:07:06,764 INFO L158 Benchmark]: Boogie Preprocessor took 72.29ms. Allocated memory is still 187.7MB. Free memory was 122.8MB in the beginning and 119.4MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 22:07:06,765 INFO L158 Benchmark]: RCFGBuilder took 563.87ms. Allocated memory is still 187.7MB. Free memory was 119.4MB in the beginning and 91.3MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-16 22:07:06,765 INFO L158 Benchmark]: TraceAbstraction took 4660.16ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 90.7MB in the beginning and 218.6MB in the end (delta: -127.9MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2023-12-16 22:07:06,769 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.37ms. Allocated memory is still 187.7MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.11ms. Allocated memory is still 187.7MB. Free memory was 142.1MB in the beginning and 125.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.81ms. Allocated memory is still 187.7MB. Free memory was 125.3MB in the beginning and 122.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.29ms. Allocated memory is still 187.7MB. Free memory was 122.8MB in the beginning and 119.4MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.87ms. Allocated memory is still 187.7MB. Free memory was 119.4MB in the beginning and 91.3MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 4660.16ms. Allocated memory was 187.7MB in the beginning and 255.9MB in the end (delta: 68.2MB). Free memory was 90.7MB in the beginning and 218.6MB in the end (delta: -127.9MB). Peak memory consumption was 36.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 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_10 = 0; [L39] const SORT_14 var_15 = 0; [L40] const SORT_1 var_24 = 1; [L41] const SORT_5 var_28 = 0; [L42] const SORT_8 var_35 = 0; [L43] const SORT_5 var_57 = 1; [L44] const SORT_5 var_61 = 1000; [L45] const SORT_5 var_63 = 3735928559; [L46] const SORT_5 var_66 = 12245771; [L48] SORT_1 input_2; [L49] SORT_1 input_3; [L50] SORT_1 input_4; [L51] SORT_5 input_6; [L52] SORT_5 input_7; [L53] SORT_8 input_9; [L55] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_14 state_16 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L57] SORT_14 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L58] SORT_5 state_29 = __VERIFIER_nondet_uint() & mask_SORT_5; [L59] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L60] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L61] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] SORT_5 state_42 = __VERIFIER_nondet_uint() & mask_SORT_5; [L64] SORT_5 state_44 = __VERIFIER_nondet_uint() & mask_SORT_5; [L66] SORT_1 init_12_arg_1 = var_10; [L67] state_11 = init_12_arg_1 [L68] SORT_14 init_17_arg_1 = var_15; [L69] state_16 = init_17_arg_1 [L70] SORT_14 init_19_arg_1 = var_15; [L71] state_18 = init_19_arg_1 [L72] SORT_5 init_30_arg_1 = var_28; [L73] state_29 = init_30_arg_1 [L74] SORT_5 init_32_arg_1 = var_28; [L75] state_31 = init_32_arg_1 [L76] SORT_8 init_37_arg_1 = var_35; [L77] state_36 = init_37_arg_1 [L78] SORT_1 init_39_arg_1 = var_24; [L79] state_38 = init_39_arg_1 [L80] SORT_1 init_41_arg_1 = var_24; [L81] state_40 = init_41_arg_1 [L82] SORT_5 init_43_arg_1 = var_28; [L83] state_42 = init_43_arg_1 [L84] SORT_5 init_45_arg_1 = var_28; [L85] state_44 = init_45_arg_1 VAL [init_12_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, init_32_arg_1=0, init_37_arg_1=0, init_39_arg_1=1, init_41_arg_1=1, init_43_arg_1=0, init_45_arg_1=0, mask_SORT_14=18446744073709551615, mask_SORT_1=1, mask_SORT_5=4294967295, mask_SORT_8=1023, msb_SORT_14=9223372036854775808, msb_SORT_1=1, msb_SORT_5=2147483648, msb_SORT_8=512, state_11=0, state_16=0, state_18=0, state_29=0, state_31=0, state_36=0, state_38=1, state_40=1, state_42=0, state_44=0, var_10=0, var_15=0, var_24=1, var_28=0, var_35=0, var_57=1, var_61=1000, var_63=3735928559, var_66=12245771] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 VAL [bad_27_arg_0=0, init_12_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, init_32_arg_1=0, init_37_arg_1=0, init_39_arg_1=1, init_41_arg_1=1, init_43_arg_1=0, init_45_arg_1=0, input_3=0, input_4=0, input_6=0, input_7=0, input_9=1008, mask_SORT_14=18446744073709551615, mask_SORT_1=1, mask_SORT_5=4294967295, mask_SORT_8=1023, msb_SORT_14=9223372036854775808, msb_SORT_1=1, msb_SORT_5=2147483648, msb_SORT_8=512, next_51_arg_1=1, next_56_arg_1=0, next_73_arg_1=0, next_76_arg_1=0, next_79_arg_1=0, next_81_arg_1=1008, next_83_arg_1=1, next_85_arg_1=1, next_88_arg_1=0, next_91_arg_1=0, state_11=1, state_16=0, state_18=0, state_29=0, state_31=0, state_36=1008, state_38=1, state_40=1, state_42=0, state_44=0, var_10=0, var_13=255, var_13_arg_0=0, var_15=0, var_20=1, var_20_arg_0=0, var_20_arg_1=0, var_21=255, var_21_arg_0=255, var_21_arg_1=1, var_24=1, var_25=0, var_25_arg_0=255, var_26=0, var_26_arg_0=1, var_26_arg_1=0, var_28=0, var_33=1, var_33_arg_0=0, var_35=0, var_46=0, var_46_arg_0=0, var_47=0, var_47_arg_0=0, var_48=0, var_48_arg_0=0, var_48_arg_1=0, var_52=0, var_52_arg_0=0, var_53=0, var_53_arg_0=0, var_54=0, var_54_arg_0=0, var_54_arg_1=0, var_55=0, var_55_arg_0=1, var_55_arg_1=0, var_55_arg_2=0, var_57=1, var_58=1, var_58_arg_0=1, var_59=1, var_59_arg_0=0, var_59_arg_1=1, var_60=0, var_60_arg_0=0, var_61=1000, var_62=0, var_62_arg_0=0, var_62_arg_1=1000, var_63=3735928559, var_64=0, var_64_arg_0=0, var_64_arg_1=3735928559, var_65=0, var_65_arg_0=0, var_65_arg_1=0, var_66=12245771, var_67=0, var_67_arg_0=0, var_67_arg_1=12245771, var_68=0, var_68_arg_0=0, var_68_arg_1=0, var_69=0, var_69_arg_0=0, var_69_arg_1=1, var_69_arg_2=0, var_70=1, var_70_arg_0=1, var_70_arg_1=1, var_71=0, var_71_arg_0=1, var_71_arg_1=0, var_71_arg_2=0, var_72=0, var_72_arg_0=1, var_72_arg_1=0, var_72_arg_2=0, var_74=0, var_74_arg_0=0, var_74_arg_1=0, var_74_arg_2=0, var_75=0, var_75_arg_0=1, var_75_arg_1=0, var_75_arg_2=0, var_77=0, var_77_arg_0=0, var_77_arg_1=0, var_77_arg_2=0, var_78=0, var_78_arg_0=1, var_78_arg_1=0, var_78_arg_2=0, var_80=1008, var_80_arg_0=1, var_80_arg_1=1008, var_80_arg_2=0, var_82=1, var_82_arg_0=1, var_82_arg_1=1, var_82_arg_2=0, var_84=1, var_84_arg_0=1, var_84_arg_1=1, var_84_arg_2=0, var_86=0, var_86_arg_0=0, var_86_arg_1=0, var_86_arg_2=0, var_87=0, var_87_arg_0=1, var_87_arg_1=0, var_87_arg_2=0, var_89=0, var_89_arg_0=0, var_89_arg_1=0, var_89_arg_2=0, var_90=0, var_90_arg_0=1, var_90_arg_1=0, var_90_arg_2=0] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L115] RET __VERIFIER_assert(!(bad_27_arg_0)) [L117] SORT_1 next_51_arg_1 = var_24; [L118] SORT_1 var_33_arg_0 = state_11; [L119] SORT_1 var_33 = ~var_33_arg_0; [L120] var_33 = var_33 & mask_SORT_1 [L121] SORT_5 var_52_arg_0 = state_29; [L122] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L123] SORT_14 var_52 = var_52_arg_0; [L124] SORT_5 var_53_arg_0 = state_31; [L125] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L126] SORT_14 var_53 = var_53_arg_0; [L127] SORT_14 var_54_arg_0 = var_52; [L128] SORT_14 var_54_arg_1 = var_53; [L129] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L130] SORT_1 var_55_arg_0 = var_33; [L131] SORT_14 var_55_arg_1 = var_15; [L132] SORT_14 var_55_arg_2 = var_54; [L133] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L134] var_55 = var_55 & mask_SORT_14 [L135] SORT_14 next_56_arg_1 = var_55; [L136] SORT_1 var_70_arg_0 = state_38; [L137] SORT_1 var_70_arg_1 = state_40; [L138] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L139] var_70 = var_70 & mask_SORT_1 [L140] SORT_8 var_60_arg_0 = state_36; [L141] var_60_arg_0 = var_60_arg_0 & mask_SORT_8 [L142] SORT_5 var_60 = var_60_arg_0; [L143] SORT_5 var_62_arg_0 = var_60; [L144] SORT_5 var_62_arg_1 = var_61; [L145] SORT_1 var_62 = var_62_arg_0 > var_62_arg_1; [L146] SORT_5 var_64_arg_0 = input_6; [L147] SORT_5 var_64_arg_1 = var_63; [L148] SORT_1 var_64 = var_64_arg_0 == var_64_arg_1; [L149] SORT_1 var_65_arg_0 = var_62; [L150] SORT_1 var_65_arg_1 = var_64; [L151] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L152] SORT_5 var_67_arg_0 = input_7; [L153] SORT_5 var_67_arg_1 = var_66; [L154] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L155] SORT_1 var_68_arg_0 = var_65; [L156] SORT_1 var_68_arg_1 = var_67; [L157] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L158] var_68 = var_68 & mask_SORT_1 [L159] SORT_5 var_46_arg_0 = state_42; [L160] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L161] SORT_14 var_46 = var_46_arg_0; [L162] SORT_5 var_47_arg_0 = state_44; [L163] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L164] SORT_14 var_47 = var_47_arg_0; [L165] SORT_14 var_48_arg_0 = var_46; [L166] SORT_14 var_48_arg_1 = var_47; [L167] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L168] SORT_5 var_58_arg_0 = var_57; [L169] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L170] SORT_14 var_58 = var_58_arg_0; [L171] SORT_14 var_59_arg_0 = var_48; [L172] SORT_14 var_59_arg_1 = var_58; [L173] SORT_14 var_59 = var_59_arg_0 + var_59_arg_1; [L174] SORT_1 var_69_arg_0 = var_68; [L175] SORT_14 var_69_arg_1 = var_59; [L176] SORT_14 var_69_arg_2 = var_48; [L177] SORT_14 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L178] SORT_1 var_71_arg_0 = var_70; [L179] SORT_14 var_71_arg_1 = var_69; [L180] SORT_14 var_71_arg_2 = state_18; [L181] SORT_14 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L182] SORT_1 var_72_arg_0 = var_33; [L183] SORT_14 var_72_arg_1 = var_15; [L184] SORT_14 var_72_arg_2 = var_71; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] var_72 = var_72 & mask_SORT_14 [L187] SORT_14 next_73_arg_1 = var_72; [L188] SORT_1 var_74_arg_0 = input_3; [L189] SORT_5 var_74_arg_1 = input_6; [L190] SORT_5 var_74_arg_2 = state_29; [L191] SORT_5 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L192] SORT_1 var_75_arg_0 = var_33; [L193] SORT_5 var_75_arg_1 = var_28; [L194] SORT_5 var_75_arg_2 = var_74; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_5 next_76_arg_1 = var_75; [L197] SORT_1 var_77_arg_0 = input_4; [L198] SORT_5 var_77_arg_1 = input_7; [L199] SORT_5 var_77_arg_2 = state_31; [L200] SORT_5 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L201] SORT_1 var_78_arg_0 = var_33; [L202] SORT_5 var_78_arg_1 = var_28; [L203] SORT_5 var_78_arg_2 = var_77; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_5 next_79_arg_1 = var_78; [L206] SORT_1 var_80_arg_0 = var_33; [L207] SORT_8 var_80_arg_1 = input_9; [L208] SORT_8 var_80_arg_2 = state_36; [L209] SORT_8 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L210] SORT_8 next_81_arg_1 = var_80; [L211] SORT_1 var_82_arg_0 = var_33; [L212] SORT_1 var_82_arg_1 = var_24; [L213] SORT_1 var_82_arg_2 = input_3; [L214] SORT_1 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L215] SORT_1 next_83_arg_1 = var_82; [L216] SORT_1 var_84_arg_0 = var_33; [L217] SORT_1 var_84_arg_1 = var_24; [L218] SORT_1 var_84_arg_2 = input_4; [L219] SORT_1 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L220] SORT_1 next_85_arg_1 = var_84; [L221] SORT_1 var_86_arg_0 = input_3; [L222] SORT_5 var_86_arg_1 = input_6; [L223] SORT_5 var_86_arg_2 = state_42; [L224] SORT_5 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L225] SORT_1 var_87_arg_0 = var_33; [L226] SORT_5 var_87_arg_1 = var_28; [L227] SORT_5 var_87_arg_2 = var_86; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_5 next_88_arg_1 = var_87; [L230] SORT_1 var_89_arg_0 = input_4; [L231] SORT_5 var_89_arg_1 = input_7; [L232] SORT_5 var_89_arg_2 = state_44; [L233] SORT_5 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L234] SORT_1 var_90_arg_0 = var_33; [L235] SORT_5 var_90_arg_1 = var_28; [L236] SORT_5 var_90_arg_2 = var_89; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_5 next_91_arg_1 = var_90; [L240] state_11 = next_51_arg_1 [L241] state_16 = next_56_arg_1 [L242] state_18 = next_73_arg_1 [L243] state_29 = next_76_arg_1 [L244] state_31 = next_79_arg_1 [L245] state_36 = next_81_arg_1 [L246] state_38 = next_83_arg_1 [L247] state_40 = next_85_arg_1 [L248] state_42 = next_88_arg_1 [L249] state_44 = next_91_arg_1 VAL [bad_27_arg_0=0, init_12_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, init_32_arg_1=0, init_37_arg_1=0, init_39_arg_1=1, init_41_arg_1=1, init_43_arg_1=0, init_45_arg_1=0, input_3=0, input_4=0, input_6=3735928559, input_7=12245771, input_9=0, mask_SORT_14=18446744073709551615, mask_SORT_1=1, mask_SORT_5=4294967295, mask_SORT_8=1023, msb_SORT_14=9223372036854775808, msb_SORT_1=1, msb_SORT_5=2147483648, msb_SORT_8=512, next_51_arg_1=1, next_56_arg_1=0, next_73_arg_1=1, next_76_arg_1=0, next_79_arg_1=0, next_81_arg_1=1008, next_83_arg_1=0, next_85_arg_1=0, next_88_arg_1=0, next_91_arg_1=0, state_11=1, state_16=0, state_18=1, state_29=0, state_31=0, state_36=1008, state_38=0, state_40=0, state_42=0, state_44=0, var_10=0, var_13=254, var_13_arg_0=1, var_15=0, var_20=1, var_20_arg_0=0, var_20_arg_1=0, var_21=255, var_21_arg_0=254, var_21_arg_1=1, var_24=1, var_25=0, var_25_arg_0=255, var_26=0, var_26_arg_0=1, var_26_arg_1=0, var_28=0, var_33=0, var_33_arg_0=1, var_35=0, var_46=0, var_46_arg_0=0, var_47=0, var_47_arg_0=0, var_48=0, var_48_arg_0=0, var_48_arg_1=0, var_52=0, var_52_arg_0=0, var_53=0, var_53_arg_0=0, var_54=0, var_54_arg_0=0, var_54_arg_1=0, var_55=0, var_55_arg_0=0, var_55_arg_1=0, var_55_arg_2=0, var_57=1, var_58=1, var_58_arg_0=1, var_59=1, var_59_arg_0=0, var_59_arg_1=1, var_60=1008, var_60_arg_0=1008, var_61=1000, var_62=1, var_62_arg_0=1008, var_62_arg_1=1000, var_63=3735928559, var_64=1, var_64_arg_0=3735928559, var_64_arg_1=3735928559, var_65=1, var_65_arg_0=1, var_65_arg_1=1, var_66=12245771, var_67=1, var_67_arg_0=12245771, var_67_arg_1=12245771, var_68=1, var_68_arg_0=1, var_68_arg_1=1, var_69=1, var_69_arg_0=1, var_69_arg_1=1, var_69_arg_2=0, var_70=1, var_70_arg_0=1, var_70_arg_1=1, var_71=1, var_71_arg_0=1, var_71_arg_1=1, var_71_arg_2=0, var_72=1, var_72_arg_0=0, var_72_arg_1=0, var_72_arg_2=1, var_74=0, var_74_arg_0=0, var_74_arg_1=3735928559, var_74_arg_2=0, var_75=0, var_75_arg_0=0, var_75_arg_1=0, var_75_arg_2=0, var_77=0, var_77_arg_0=0, var_77_arg_1=12245771, var_77_arg_2=0, var_78=0, var_78_arg_0=0, var_78_arg_1=0, var_78_arg_2=0, var_80=1008, var_80_arg_0=0, var_80_arg_1=0, var_80_arg_2=1008, var_82=0, var_82_arg_0=0, var_82_arg_1=1, var_82_arg_2=0, var_84=0, var_84_arg_0=0, var_84_arg_1=1, var_84_arg_2=0, var_86=0, var_86_arg_0=0, var_86_arg_1=3735928559, var_86_arg_2=0, var_87=0, var_87_arg_0=0, var_87_arg_1=0, var_87_arg_2=0, var_89=0, var_89_arg_0=0, var_89_arg_1=12245771, var_89_arg_2=0, var_90=0, var_90_arg_0=0, var_90_arg_1=0, var_90_arg_2=0] [L88] input_2 = __VERIFIER_nondet_uchar() [L89] input_3 = __VERIFIER_nondet_uchar() [L90] input_3 = input_3 & mask_SORT_1 [L91] input_4 = __VERIFIER_nondet_uchar() [L92] input_4 = input_4 & mask_SORT_1 [L93] input_6 = __VERIFIER_nondet_uint() [L94] input_6 = input_6 & mask_SORT_5 [L95] input_7 = __VERIFIER_nondet_uint() [L96] input_7 = input_7 & mask_SORT_5 [L97] input_9 = __VERIFIER_nondet_ushort() [L100] SORT_1 var_13_arg_0 = state_11; [L101] SORT_1 var_13 = ~var_13_arg_0; [L102] SORT_14 var_20_arg_0 = state_16; [L103] SORT_14 var_20_arg_1 = state_18; [L104] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L105] SORT_1 var_21_arg_0 = var_13; [L106] SORT_1 var_21_arg_1 = var_20; [L107] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L108] SORT_1 var_25_arg_0 = var_21; [L109] SORT_1 var_25 = ~var_25_arg_0; [L110] SORT_1 var_26_arg_0 = var_24; [L111] SORT_1 var_26_arg_1 = var_25; [L112] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L113] var_26 = var_26 & mask_SORT_1 [L114] SORT_1 bad_27_arg_0 = var_26; [L115] CALL __VERIFIER_assert(!(bad_27_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: 4.5s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.0s 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.3s 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.8s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 4 QuantifiedInterpolants, 385 SizeOfPredicates, 49 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 49 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:07:06,795 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...