/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 09:22:15,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 09:22:15,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-01 09:22:15,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 09:22:15,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 09:22:15,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 09:22:15,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 09:22:15,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 09:22:15,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 09:22:15,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 09:22:15,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 09:22:15,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 09:22:15,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 09:22:15,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 09:22:15,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 09:22:15,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 09:22:15,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 09:22:15,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 09:22:15,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 09:22:15,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 09:22:15,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 09:22:15,405 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 09:22:15,405 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 09:22:15,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 09:22:15,406 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 09:22:15,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 09:22:15,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 09:22:15,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 09:22:15,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 09:22:15,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 09:22:15,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 09:22:15,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 09:22:15,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 09:22:15,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 09:22:15,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 09:22:15,412 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 09:22:15,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:15,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 09:22:15,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 09:22:15,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 09:22:15,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 09:22:15,414 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 09:22:15,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:15,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 09:22:15,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 09:22:15,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 09:22:15,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 09:22:15,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 09:22:15,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-11-01 09:22:17,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 09:22:17,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 09:22:17,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.mul6.c [2024-11-01 09:22:17,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8646dfe5/4db1b038304249838cceca55e963d97d/FLAG3cd56334f [2024-11-01 09:22:17,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8646dfe5/4db1b038304249838cceca55e963d97d [2024-11-01 09:22:17,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 09:22:17,726 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 09:22:17,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 09:22:17,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 09:22:17,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 09:22:17,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:22:17" (1/1) ... [2024-11-01 09:22:17,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c833bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:17, skipping insertion in model container [2024-11-01 09:22:17,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:22:17" (1/1) ... [2024-11-01 09:22:17,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 09:22:17,950 WARN L251 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.mul6.c[1298,1311] [2024-11-01 09:22:18,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 09:22:18,051 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 09:22:18,069 WARN L251 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.mul6.c[1298,1311] [2024-11-01 09:22:18,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 09:22:18,148 INFO L204 MainTranslator]: Completed translation [2024-11-01 09:22:18,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18 WrapperNode [2024-11-01 09:22:18,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 09:22:18,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 09:22:18,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 09:22:18,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 09:22:18,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,214 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 271 [2024-11-01 09:22:18,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 09:22:18,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 09:22:18,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 09:22:18,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 09:22:18,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,257 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]. [2024-11-01 09:22:18,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 09:22:18,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 09:22:18,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 09:22:18,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 09:22:18,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (1/1) ... [2024-11-01 09:22:18,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 09:22:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 09:22:18,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-01 09:22:18,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-01 09:22:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 09:22:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 09:22:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-01 09:22:18,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 09:22:18,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 09:22:18,467 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 09:22:18,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 09:22:19,350 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-01 09:22:19,350 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 09:22:19,366 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 09:22:19,367 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 09:22:19,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:22:19 BoogieIcfgContainer [2024-11-01 09:22:19,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 09:22:19,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 09:22:19,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 09:22:19,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 09:22:19,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 09:22:17" (1/3) ... [2024-11-01 09:22:19,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d192da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:22:19, skipping insertion in model container [2024-11-01 09:22:19,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:22:18" (2/3) ... [2024-11-01 09:22:19,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d192da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:22:19, skipping insertion in model container [2024-11-01 09:22:19,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:22:19" (3/3) ... [2024-11-01 09:22:19,378 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul6.c [2024-11-01 09:22:19,395 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 09:22:19,395 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 09:22:19,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 09:22:19,454 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6deb437e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 09:22:19,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 09:22:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 09:22:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 09:22:19,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 09:22:19,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 09:22:19,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 09:22:19,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 09:22:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 09:22:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 09:22:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1534758248] [2024-11-01 09:22:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 09:22:19,478 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:19,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-01 09:22:19,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-01 09:22:19,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-01 09:22:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 09:22:19,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-01 09:22:19,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 09:22:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 09:22:19,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 09:22:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 09:22:20,150 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 09:22:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1534758248] [2024-11-01 09:22:20,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1534758248] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 09:22:20,151 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 09:22:20,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 09:22:20,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123251527] [2024-11-01 09:22:20,154 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 09:22:20,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 09:22:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 09:22:20,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 09:22:20,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 09:22:20,185 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 09:22:21,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-01 09:22:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 09:22:21,728 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-01 09:22:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 09:22:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-01 09:22:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 09:22:21,736 INFO L225 Difference]: With dead ends: 18 [2024-11-01 09:22:21,737 INFO L226 Difference]: Without dead ends: 10 [2024-11-01 09:22:21,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-01 09:22:21,743 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-01 09:22:21,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-01 09:22:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-01 09:22:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-01 09:22:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 09:22:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 09:22:21,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 09:22:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 09:22:21,772 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 09:22:21,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 09:22:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 09:22:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 09:22:21,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 09:22:21,773 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 09:22:21,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-01 09:22:21,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:21,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 09:22:21,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 09:22:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 09:22:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 09:22:21,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [460986111] [2024-11-01 09:22:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 09:22:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-01 09:22:21,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-01 09:22:21,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-01 09:22:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 09:22:22,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-01 09:22:22,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 09:22:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 09:22:23,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 09:22:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 09:22:48,269 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 09:22:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [460986111] [2024-11-01 09:22:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [460986111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 09:22:48,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 09:22:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-01 09:22:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432531613] [2024-11-01 09:22:48,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 09:22:48,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-01 09:22:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 09:22:48,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-01 09:22:48,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-01 09:22:48,272 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 09:22:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 09:22:50,076 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-01 09:22:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-01 09:22:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-01 09:22:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 09:22:50,077 INFO L225 Difference]: With dead ends: 14 [2024-11-01 09:22:50,077 INFO L226 Difference]: Without dead ends: 12 [2024-11-01 09:22:50,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-01 09:22:50,078 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-01 09:22:50,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-01 09:22:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-01 09:22:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-01 09:22:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 09:22:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-01 09:22:50,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-01 09:22:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 09:22:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-01 09:22:50,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 09:22:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-01 09:22:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-01 09:22:50,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 09:22:50,098 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-01 09:22:50,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-11-01 09:22:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:50,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 09:22:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 09:22:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-01 09:22:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 09:22:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [906048253] [2024-11-01 09:22:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 09:22:50,301 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:50,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-01 09:22:50,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-01 09:22:50,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-01 09:22:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 09:22:51,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 09:22:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 09:22:52,704 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 09:22:52,705 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 09:22:52,705 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 09:22:52,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-01 09:22:52,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-01 09:22:52,910 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-01 09:22:52,952 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 09:22:52,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 09:22:52 BoogieIcfgContainer [2024-11-01 09:22:52,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 09:22:52,956 INFO L158 Benchmark]: Toolchain (without parser) took 35230.29ms. Allocated memory was 202.4MB in the beginning and 310.4MB in the end (delta: 108.0MB). Free memory was 177.9MB in the beginning and 257.4MB in the end (delta: -79.4MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2024-11-01 09:22:52,957 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 202.4MB. Free memory was 179.2MB in the beginning and 179.1MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 09:22:52,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.73ms. Allocated memory is still 202.4MB. Free memory was 177.4MB in the beginning and 159.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-11-01 09:22:52,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.49ms. Allocated memory is still 202.4MB. Free memory was 159.0MB in the beginning and 156.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 09:22:52,958 INFO L158 Benchmark]: Boogie Preprocessor took 75.55ms. Allocated memory is still 202.4MB. Free memory was 156.4MB in the beginning and 153.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-01 09:22:52,962 INFO L158 Benchmark]: RCFGBuilder took 1076.25ms. Allocated memory is still 202.4MB. Free memory was 153.3MB in the beginning and 126.5MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2024-11-01 09:22:52,962 INFO L158 Benchmark]: TraceAbstraction took 33584.43ms. Allocated memory was 202.4MB in the beginning and 310.4MB in the end (delta: 108.0MB). Free memory was 125.5MB in the beginning and 257.4MB in the end (delta: -131.9MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 09:22:52,964 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.15ms. Allocated memory is still 202.4MB. Free memory was 179.2MB in the beginning and 179.1MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.73ms. Allocated memory is still 202.4MB. Free memory was 177.4MB in the beginning and 159.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.49ms. Allocated memory is still 202.4MB. Free memory was 159.0MB in the beginning and 156.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.55ms. Allocated memory is still 202.4MB. Free memory was 156.4MB in the beginning and 153.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1076.25ms. Allocated memory is still 202.4MB. Free memory was 153.3MB in the beginning and 126.5MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 33584.43ms. Allocated memory was 202.4MB in the beginning and 310.4MB in the end (delta: 108.0MB). Free memory was 125.5MB in the beginning and 257.4MB in the end (delta: -131.9MB). There was no memory consumed. 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: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 10); [L34] const SORT_8 msb_SORT_8 = (SORT_8)1 << (10 - 1); [L36] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 128); [L37] const SORT_14 msb_SORT_14 = (SORT_14)1 << (128 - 1); [L39] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 32); [L40] const SORT_57 msb_SORT_57 = (SORT_57)1 << (32 - 1); [L42] const SORT_1 var_10 = 0; [L43] const SORT_14 var_15 = 0; [L44] const SORT_1 var_24 = 1; [L45] const SORT_5 var_28 = 0; [L46] const SORT_8 var_35 = 0; [L47] const SORT_57 var_58 = 1; [L48] const SORT_57 var_62 = 1000; [L49] const SORT_5 var_64 = 9223372036854775807; [L50] const SORT_5 var_67 = 12245771; [L52] SORT_1 input_2; [L53] SORT_1 input_3; [L54] SORT_1 input_4; [L55] SORT_5 input_6; [L56] SORT_5 input_7; [L57] SORT_8 input_9; [L59] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] SORT_14 state_16 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L61] SORT_14 state_18 = __VERIFIER_nondet_uint128() & mask_SORT_14; [L62] SORT_5 state_29 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L63] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L64] SORT_8 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_8; [L65] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] SORT_5 state_42 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L68] SORT_5 state_44 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L70] SORT_1 init_12_arg_1 = var_10; [L71] state_11 = init_12_arg_1 [L72] SORT_14 init_17_arg_1 = var_15; [L73] state_16 = init_17_arg_1 [L74] SORT_14 init_19_arg_1 = var_15; [L75] state_18 = init_19_arg_1 [L76] SORT_5 init_30_arg_1 = var_28; [L77] state_29 = init_30_arg_1 [L78] SORT_5 init_32_arg_1 = var_28; [L79] state_31 = init_32_arg_1 [L80] SORT_8 init_37_arg_1 = var_35; [L81] state_36 = init_37_arg_1 [L82] SORT_1 init_39_arg_1 = var_24; [L83] state_38 = init_39_arg_1 [L84] SORT_1 init_41_arg_1 = var_24; [L85] state_40 = init_41_arg_1 [L86] SORT_5 init_43_arg_1 = var_28; [L87] state_42 = init_43_arg_1 [L88] SORT_5 init_45_arg_1 = var_28; [L89] state_44 = init_45_arg_1 VAL [mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_57=-1, mask_SORT_5=-1, mask_SORT_8=1023, 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_15=0, var_24=1, var_28=0, var_58=1, var_62=1000, var_64=9223372036854775807, var_67=12245771] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND FALSE !(!(cond)) [L119] RET __VERIFIER_assert(!(bad_27_arg_0)) [L121] SORT_1 next_51_arg_1 = var_24; [L122] SORT_1 var_33_arg_0 = state_11; [L123] SORT_1 var_33 = ~var_33_arg_0; [L124] var_33 = var_33 & mask_SORT_1 [L125] SORT_5 var_52_arg_0 = state_29; [L126] var_52_arg_0 = var_52_arg_0 & mask_SORT_5 [L127] SORT_14 var_52 = var_52_arg_0; [L128] SORT_5 var_53_arg_0 = state_31; [L129] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L130] SORT_14 var_53 = var_53_arg_0; [L131] SORT_14 var_54_arg_0 = var_52; [L132] SORT_14 var_54_arg_1 = var_53; [L133] SORT_14 var_54 = var_54_arg_0 * var_54_arg_1; [L134] SORT_1 var_55_arg_0 = var_33; [L135] SORT_14 var_55_arg_1 = var_15; [L136] SORT_14 var_55_arg_2 = var_54; [L137] SORT_14 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L138] var_55 = var_55 & mask_SORT_14 [L139] SORT_14 next_56_arg_1 = var_55; [L140] SORT_1 var_71_arg_0 = state_38; [L141] SORT_1 var_71_arg_1 = state_40; [L142] SORT_1 var_71 = var_71_arg_0 | var_71_arg_1; [L143] var_71 = var_71 & mask_SORT_1 [L144] SORT_8 var_61_arg_0 = state_36; [L145] var_61_arg_0 = var_61_arg_0 & mask_SORT_8 [L146] SORT_57 var_61 = var_61_arg_0; [L147] SORT_57 var_63_arg_0 = var_61; [L148] SORT_57 var_63_arg_1 = var_62; [L149] SORT_1 var_63 = var_63_arg_0 > var_63_arg_1; [L150] SORT_5 var_65_arg_0 = input_6; [L151] SORT_5 var_65_arg_1 = var_64; [L152] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L153] SORT_1 var_66_arg_0 = var_63; [L154] SORT_1 var_66_arg_1 = var_65; [L155] SORT_1 var_66 = var_66_arg_0 & var_66_arg_1; [L156] SORT_5 var_68_arg_0 = input_7; [L157] SORT_5 var_68_arg_1 = var_67; [L158] SORT_1 var_68 = var_68_arg_0 == var_68_arg_1; [L159] SORT_1 var_69_arg_0 = var_66; [L160] SORT_1 var_69_arg_1 = var_68; [L161] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L162] var_69 = var_69 & mask_SORT_1 [L163] SORT_5 var_46_arg_0 = state_42; [L164] var_46_arg_0 = var_46_arg_0 & mask_SORT_5 [L165] SORT_14 var_46 = var_46_arg_0; [L166] SORT_5 var_47_arg_0 = state_44; [L167] var_47_arg_0 = var_47_arg_0 & mask_SORT_5 [L168] SORT_14 var_47 = var_47_arg_0; [L169] SORT_14 var_48_arg_0 = var_46; [L170] SORT_14 var_48_arg_1 = var_47; [L171] SORT_14 var_48 = var_48_arg_0 * var_48_arg_1; [L172] SORT_57 var_59_arg_0 = var_58; [L173] var_59_arg_0 = var_59_arg_0 & mask_SORT_57 [L174] SORT_14 var_59 = var_59_arg_0; [L175] SORT_14 var_60_arg_0 = var_48; [L176] SORT_14 var_60_arg_1 = var_59; [L177] SORT_14 var_60 = var_60_arg_0 + var_60_arg_1; [L178] SORT_1 var_70_arg_0 = var_69; [L179] SORT_14 var_70_arg_1 = var_60; [L180] SORT_14 var_70_arg_2 = var_48; [L181] SORT_14 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L182] SORT_1 var_72_arg_0 = var_71; [L183] SORT_14 var_72_arg_1 = var_70; [L184] SORT_14 var_72_arg_2 = state_18; [L185] SORT_14 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L186] SORT_1 var_73_arg_0 = var_33; [L187] SORT_14 var_73_arg_1 = var_15; [L188] SORT_14 var_73_arg_2 = var_72; [L189] SORT_14 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L190] var_73 = var_73 & mask_SORT_14 [L191] SORT_14 next_74_arg_1 = var_73; [L192] SORT_1 var_75_arg_0 = input_3; [L193] SORT_5 var_75_arg_1 = input_6; [L194] SORT_5 var_75_arg_2 = state_29; [L195] SORT_5 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L196] SORT_1 var_76_arg_0 = var_33; [L197] SORT_5 var_76_arg_1 = var_28; [L198] SORT_5 var_76_arg_2 = var_75; [L199] SORT_5 var_76 = var_76_arg_0 ? var_76_arg_1 : var_76_arg_2; [L200] SORT_5 next_77_arg_1 = var_76; [L201] SORT_1 var_78_arg_0 = input_4; [L202] SORT_5 var_78_arg_1 = input_7; [L203] SORT_5 var_78_arg_2 = state_31; [L204] SORT_5 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L205] SORT_1 var_79_arg_0 = var_33; [L206] SORT_5 var_79_arg_1 = var_28; [L207] SORT_5 var_79_arg_2 = var_78; [L208] SORT_5 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L209] SORT_5 next_80_arg_1 = var_79; [L210] SORT_1 var_81_arg_0 = var_33; [L211] SORT_8 var_81_arg_1 = input_9; [L212] SORT_8 var_81_arg_2 = state_36; [L213] SORT_8 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L214] SORT_8 next_82_arg_1 = var_81; [L215] SORT_1 var_83_arg_0 = var_33; [L216] SORT_1 var_83_arg_1 = var_24; [L217] SORT_1 var_83_arg_2 = input_3; [L218] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L219] SORT_1 next_84_arg_1 = var_83; [L220] SORT_1 var_85_arg_0 = var_33; [L221] SORT_1 var_85_arg_1 = var_24; [L222] SORT_1 var_85_arg_2 = input_4; [L223] SORT_1 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L224] SORT_1 next_86_arg_1 = var_85; [L225] SORT_1 var_87_arg_0 = input_3; [L226] SORT_5 var_87_arg_1 = input_6; [L227] SORT_5 var_87_arg_2 = state_42; [L228] SORT_5 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L229] SORT_1 var_88_arg_0 = var_33; [L230] SORT_5 var_88_arg_1 = var_28; [L231] SORT_5 var_88_arg_2 = var_87; [L232] SORT_5 var_88 = var_88_arg_0 ? var_88_arg_1 : var_88_arg_2; [L233] SORT_5 next_89_arg_1 = var_88; [L234] SORT_1 var_90_arg_0 = input_4; [L235] SORT_5 var_90_arg_1 = input_7; [L236] SORT_5 var_90_arg_2 = state_44; [L237] SORT_5 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L238] SORT_1 var_91_arg_0 = var_33; [L239] SORT_5 var_91_arg_1 = var_28; [L240] SORT_5 var_91_arg_2 = var_90; [L241] SORT_5 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L242] SORT_5 next_92_arg_1 = var_91; [L244] state_11 = next_51_arg_1 [L245] state_16 = next_56_arg_1 [L246] state_18 = next_74_arg_1 [L247] state_29 = next_77_arg_1 [L248] state_31 = next_80_arg_1 [L249] state_36 = next_82_arg_1 [L250] state_38 = next_84_arg_1 [L251] state_40 = next_86_arg_1 [L252] state_42 = next_89_arg_1 [L253] state_44 = next_92_arg_1 [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_3 = input_3 & mask_SORT_1 [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_4 = input_4 & mask_SORT_1 [L97] input_6 = __VERIFIER_nondet_ulong() [L98] input_6 = input_6 & mask_SORT_5 [L99] input_7 = __VERIFIER_nondet_ulong() [L100] input_7 = input_7 & mask_SORT_5 [L101] input_9 = __VERIFIER_nondet_ushort() [L104] SORT_1 var_13_arg_0 = state_11; [L105] SORT_1 var_13 = ~var_13_arg_0; [L106] SORT_14 var_20_arg_0 = state_16; [L107] SORT_14 var_20_arg_1 = state_18; [L108] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L109] SORT_1 var_21_arg_0 = var_13; [L110] SORT_1 var_21_arg_1 = var_20; [L111] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L112] SORT_1 var_25_arg_0 = var_21; [L113] SORT_1 var_25 = ~var_25_arg_0; [L114] SORT_1 var_26_arg_0 = var_24; [L115] SORT_1 var_26_arg_1 = var_25; [L116] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L117] var_26 = var_26 & mask_SORT_1 [L118] SORT_1 bad_27_arg_0 = var_26; [L119] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 5 QuantifiedInterpolants, 782 SizeOfPredicates, 25 NumberOfNonLiveVariables, 191 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 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! [2024-11-01 09:22:53,018 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...