/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 Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 00:49:31,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 00:49:31,420 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 00:49:31,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 00:49:31,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 00:49:31,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 00:49:31,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 00:49:31,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 00:49:31,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 00:49:31,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 00:49:31,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 00:49:31,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 00:49:31,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 00:49:31,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 00:49:31,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 00:49:31,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 00:49:31,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 00:49:31,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 00:49:31,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 00:49:31,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 00:49:31,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 00:49:31,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 00:49:31,469 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 00:49:31,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 00:49:31,470 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 00:49:31,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 00:49:31,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 00:49:31,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 00:49:31,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 00:49:31,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 00:49:31,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 00:49:31,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 00:49:31,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 00:49:31,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 00:49:31,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 00:49:31,475 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 00:49:31,475 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 00:49:31,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 00:49:31,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 00:49:31,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 00:49:31,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 00:49:31,476 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 00:49:31,476 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 -> Internal_SMTInterpol [2024-11-01 00:49:31,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 00:49:31,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 00:49:31,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 00:49:31,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 00:49:31,796 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 00:49:31,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-01 00:49:33,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 00:49:33,402 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 00:49:33,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2024-11-01 00:49:33,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb0fda0b4/677d2c82c5064fb9a8b4047a3b516a32/FLAG4fdee8a8b [2024-11-01 00:49:33,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb0fda0b4/677d2c82c5064fb9a8b4047a3b516a32 [2024-11-01 00:49:33,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 00:49:33,719 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 00:49:33,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 00:49:33,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 00:49:33,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 00:49:33,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:33,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7883877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33, skipping insertion in model container [2024-11-01 00:49:33,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:33,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 00:49:33,873 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.factorial4even.c[1439,1452] [2024-11-01 00:49:33,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 00:49:33,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 00:49:33,933 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.factorial4even.c[1439,1452] [2024-11-01 00:49:33,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 00:49:33,961 INFO L204 MainTranslator]: Completed translation [2024-11-01 00:49:33,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33 WrapperNode [2024-11-01 00:49:33,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 00:49:33,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 00:49:33,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 00:49:33,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 00:49:33,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:33,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:33,993 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-01 00:49:33,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 00:49:33,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 00:49:33,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 00:49:33,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 00:49:34,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,016 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-01 00:49:34,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 00:49:34,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 00:49:34,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 00:49:34,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 00:49:34,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (1/1) ... [2024-11-01 00:49:34,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 00:49:34,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 00:49:34,064 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 00:49:34,069 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 00:49:34,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 00:49:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 00:49:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 00:49:34,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 00:49:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-01 00:49:34,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-01 00:49:34,143 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 00:49:34,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 00:49:34,248 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-01 00:49:34,248 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 00:49:34,258 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 00:49:34,259 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 00:49:34,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 12:49:34 BoogieIcfgContainer [2024-11-01 00:49:34,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 00:49:34,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 00:49:34,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 00:49:34,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 00:49:34,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 12:49:33" (1/3) ... [2024-11-01 00:49:34,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbfd383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 12:49:34, skipping insertion in model container [2024-11-01 00:49:34,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:49:33" (2/3) ... [2024-11-01 00:49:34,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbfd383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 12:49:34, skipping insertion in model container [2024-11-01 00:49:34,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 12:49:34" (3/3) ... [2024-11-01 00:49:34,265 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2024-11-01 00:49:34,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 00:49:34,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 00:49:34,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 00:49:34,325 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;@6b9b8e86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 00:49:34,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 00:49:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 00:49:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-01 00:49:34,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:49:34,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-01 00:49:34,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:49:34,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:49:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1806460890, now seen corresponding path program 1 times [2024-11-01 00:49:34,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:49:34,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1285327508] [2024-11-01 00:49:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:49:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:49:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 00:49:34,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-01 00:49:34,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 00:49:34,686 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 00:49:34,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 00:49:34,744 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 00:49:34,744 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 00:49:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1285327508] [2024-11-01 00:49:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1285327508] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 00:49:34,745 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 00:49:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-01 00:49:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178015318] [2024-11-01 00:49:34,748 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 00:49:34,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-01 00:49:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 00:49:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-01 00:49:34,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-01 00:49:34,770 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 00:49:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 00:49:34,858 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-01 00:49:34,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-01 00:49:34,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-01 00:49:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 00:49:34,867 INFO L225 Difference]: With dead ends: 36 [2024-11-01 00:49:34,867 INFO L226 Difference]: Without dead ends: 22 [2024-11-01 00:49:34,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-01 00:49:34,872 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 00:49:34,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 00:49:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-01 00:49:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-01 00:49:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-01 00:49:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-01 00:49:34,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2024-11-01 00:49:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 00:49:34,895 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-01 00:49:34,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 00:49:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-01 00:49:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-01 00:49:34,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:49:34,896 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 00:49:34,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-01 00:49:34,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:49:34,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:49:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash -361639814, now seen corresponding path program 1 times [2024-11-01 00:49:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:49:34,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592313020] [2024-11-01 00:49:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:49:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:49:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 00:49:35,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-01 00:49:35,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 00:49:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 00:49:36,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 00:49:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 00:49:36,208 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 00:49:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592313020] [2024-11-01 00:49:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1592313020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 00:49:36,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 00:49:36,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2024-11-01 00:49:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749662481] [2024-11-01 00:49:36,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 00:49:36,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-01 00:49:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 00:49:36,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-01 00:49:36,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-01 00:49:36,212 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 00:49:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 00:49:36,301 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-01 00:49:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-01 00:49:36,301 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-11-01 00:49:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 00:49:36,302 INFO L225 Difference]: With dead ends: 28 [2024-11-01 00:49:36,302 INFO L226 Difference]: Without dead ends: 26 [2024-11-01 00:49:36,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-01 00:49:36,303 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 00:49:36,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 00:49:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-01 00:49:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-01 00:49:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-01 00:49:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-01 00:49:36,310 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2024-11-01 00:49:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 00:49:36,311 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-01 00:49:36,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 00:49:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-01 00:49:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-01 00:49:36,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:49:36,311 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 00:49:36,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-01 00:49:36,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:49:36,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:49:36,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2143106440, now seen corresponding path program 1 times [2024-11-01 00:49:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:49:36,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1696068623] [2024-11-01 00:49:36,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:49:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:49:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 00:49:37,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-01 00:49:37,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 00:49:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-01 00:49:37,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 00:49:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-01 00:49:37,319 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 00:49:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1696068623] [2024-11-01 00:49:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1696068623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 00:49:37,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 00:49:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-11-01 00:49:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659949792] [2024-11-01 00:49:37,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 00:49:37,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-01 00:49:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 00:49:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-01 00:49:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-01 00:49:37,325 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 00:49:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 00:49:37,518 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-01 00:49:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-01 00:49:37,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-11-01 00:49:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 00:49:37,520 INFO L225 Difference]: With dead ends: 47 [2024-11-01 00:49:37,520 INFO L226 Difference]: Without dead ends: 45 [2024-11-01 00:49:37,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-01 00:49:37,521 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 00:49:37,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 00:49:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-01 00:49:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-01 00:49:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 00:49:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-01 00:49:37,529 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2024-11-01 00:49:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 00:49:37,530 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-01 00:49:37,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 00:49:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-01 00:49:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-01 00:49:37,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:49:37,530 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-01 00:49:37,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-01 00:49:37,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:49:37,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:49:37,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2135901336, now seen corresponding path program 2 times [2024-11-01 00:49:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:49:37,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1714548089] [2024-11-01 00:49:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:49:37,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:49:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 00:49:39,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-01 00:49:39,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 00:49:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-01 00:49:39,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 00:49:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-01 00:49:40,142 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 00:49:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1714548089] [2024-11-01 00:49:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1714548089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 00:49:40,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 00:49:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2024-11-01 00:49:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178562293] [2024-11-01 00:49:40,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 00:49:40,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-01 00:49:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 00:49:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-01 00:49:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-01 00:49:40,144 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-01 00:49:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 00:49:40,387 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-01 00:49:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-01 00:49:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2024-11-01 00:49:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 00:49:40,389 INFO L225 Difference]: With dead ends: 48 [2024-11-01 00:49:40,389 INFO L226 Difference]: Without dead ends: 46 [2024-11-01 00:49:40,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-11-01 00:49:40,390 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 00:49:40,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 00:49:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-01 00:49:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-01 00:49:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-01 00:49:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-01 00:49:40,398 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2024-11-01 00:49:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 00:49:40,398 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-01 00:49:40,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-01 00:49:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-01 00:49:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-01 00:49:40,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:49:40,399 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2024-11-01 00:49:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-01 00:49:40,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:49:40,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:49:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -291480616, now seen corresponding path program 3 times [2024-11-01 00:49:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:49:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1717231926] [2024-11-01 00:49:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:49:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:49:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-01 00:49:42,973 WARN L124 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2024-11-01 00:49:42,974 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-01 00:49:42,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 00:49:42,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-01 00:49:42,981 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-01 00:49:42,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 00:49:42,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 12:49:42 BoogieIcfgContainer [2024-11-01 00:49:42,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 00:49:42,994 INFO L158 Benchmark]: Toolchain (without parser) took 9274.55ms. Allocated memory was 196.1MB in the beginning and 921.7MB in the end (delta: 725.6MB). Free memory was 171.5MB in the beginning and 635.1MB in the end (delta: -463.6MB). Peak memory consumption was 554.5MB. Max. memory is 8.0GB. [2024-11-01 00:49:42,994 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory was 172.8MB in the beginning and 172.7MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 00:49:42,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.74ms. Allocated memory is still 196.1MB. Free memory was 170.9MB in the beginning and 157.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-01 00:49:42,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.41ms. Allocated memory is still 196.1MB. Free memory was 157.3MB in the beginning and 155.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 00:49:42,995 INFO L158 Benchmark]: Boogie Preprocessor took 33.66ms. Allocated memory is still 196.1MB. Free memory was 155.7MB in the beginning and 154.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-01 00:49:42,995 INFO L158 Benchmark]: RCFGBuilder took 230.17ms. Allocated memory is still 196.1MB. Free memory was 153.6MB in the beginning and 141.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-01 00:49:42,995 INFO L158 Benchmark]: TraceAbstraction took 8732.01ms. Allocated memory was 196.1MB in the beginning and 921.7MB in the end (delta: 725.6MB). Free memory was 140.0MB in the beginning and 635.1MB in the end (delta: -495.1MB). Peak memory consumption was 523.0MB. Max. memory is 8.0GB. [2024-11-01 00:49:42,996 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.10ms. Allocated memory is still 196.1MB. Free memory was 172.8MB in the beginning and 172.7MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.74ms. Allocated memory is still 196.1MB. Free memory was 170.9MB in the beginning and 157.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.41ms. Allocated memory is still 196.1MB. Free memory was 157.3MB in the beginning and 155.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.66ms. Allocated memory is still 196.1MB. Free memory was 155.7MB in the beginning and 154.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 230.17ms. Allocated memory is still 196.1MB. Free memory was 153.6MB in the beginning and 141.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8732.01ms. Allocated memory was 196.1MB in the beginning and 921.7MB in the end (delta: 725.6MB). Free memory was 140.0MB in the beginning and 635.1MB in the end (delta: -495.1MB). Peak memory consumption was 523.0MB. 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 - UnprovableResult [Line: 29]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L34] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L35] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L37] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 1); [L38] const SORT_12 msb_SORT_12 = (SORT_12)1 << (1 - 1); [L40] const SORT_1 var_2 = 1; [L41] const SORT_1 var_11 = mask_SORT_1; [L42] const SORT_1 var_16 = 3; [L45] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 init_5_arg_1 = var_2; [L49] state_3 = init_5_arg_1 [L50] SORT_1 init_6_arg_1 = var_2; [L51] state_4 = init_6_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) [L29] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L29] COND FALSE !(!(cond)) [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) [L29] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L29] COND FALSE !(!(cond)) [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) [L29] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L29] COND FALSE !(!(cond)) [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) [L29] COND FALSE !(!(cond)) [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L29] COND TRUE !(cond) [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 34 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 45, 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, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 124 ConstructedInterpolants, 8 QuantifiedInterpolants, 809 SizeOfPredicates, 29 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 36/68 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-01 00:49:43,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...