/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 06:26:09,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 06:26:09,482 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-06 06:26:09,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 06:26:09,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 06:26:09,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 06:26:09,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 06:26:09,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 06:26:09,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 06:26:09,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 06:26:09,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 06:26:09,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 06:26:09,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 06:26:09,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 06:26:09,531 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 06:26:09,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 06:26:09,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 06:26:09,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 06:26:09,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 06:26:09,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 06:26:09,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 06:26:09,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 06:26:09,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 06:26:09,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 06:26:09,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 06:26:09,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 06:26:09,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 06:26:09,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 06:26:09,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 06:26:09,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 06:26:09,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 06:26:09,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:26:09,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 06:26:09,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 06:26:09,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 06:26:09,539 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 06:26:09,539 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 06:26:09,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 06:26:09,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 06:26:09,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 06:26:09,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 06:26:09,541 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.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 06:26:09,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 06:26:09,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 06:26:09,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 06:26:09,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 06:26:09,842 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 06:26:09,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c [2024-11-06 06:26:11,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 06:26:11,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 06:26:11,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c [2024-11-06 06:26:11,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51915aa34/6dde335eba1b444ebbafb5e989d12f6a/FLAG5e770d324 [2024-11-06 06:26:11,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51915aa34/6dde335eba1b444ebbafb5e989d12f6a [2024-11-06 06:26:11,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 06:26:11,981 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 06:26:11,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 06:26:11,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 06:26:11,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 06:26:11,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:26:11" (1/1) ... [2024-11-06 06:26:11,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad0faf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:11, skipping insertion in model container [2024-11-06 06:26:11,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:26:11" (1/1) ... [2024-11-06 06:26:12,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 06:26:12,292 WARN L250 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.circular_pointer_top_w64_d64_e0.c[1280,1293] [2024-11-06 06:26:12,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:26:12,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 06:26:12,796 WARN L250 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.circular_pointer_top_w64_d64_e0.c[1280,1293] [2024-11-06 06:26:12,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:26:12,980 INFO L204 MainTranslator]: Completed translation [2024-11-06 06:26:12,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12 WrapperNode [2024-11-06 06:26:12,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 06:26:12,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 06:26:12,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 06:26:12,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 06:26:12,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,144 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2549 [2024-11-06 06:26:13,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 06:26:13,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 06:26:13,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 06:26:13,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 06:26:13,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,262 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-06 06:26:13,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 06:26:13,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 06:26:13,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 06:26:13,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 06:26:13,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (1/1) ... [2024-11-06 06:26:13,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:26:13,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 06:26:13,423 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-06 06:26:13,426 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-06 06:26:13,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 06:26:13,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 06:26:13,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 06:26:13,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 06:26:13,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 06:26:13,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 06:26:13,839 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 06:26:13,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 06:26:15,997 INFO L? ?]: Removed 705 outVars from TransFormulas that were not future-live. [2024-11-06 06:26:15,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 06:26:16,009 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 06:26:16,009 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 06:26:16,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:26:16 BoogieIcfgContainer [2024-11-06 06:26:16,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 06:26:16,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 06:26:16,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 06:26:16,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 06:26:16,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:26:11" (1/3) ... [2024-11-06 06:26:16,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d339077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:26:16, skipping insertion in model container [2024-11-06 06:26:16,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:12" (2/3) ... [2024-11-06 06:26:16,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d339077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:26:16, skipping insertion in model container [2024-11-06 06:26:16,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:26:16" (3/3) ... [2024-11-06 06:26:16,022 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d64_e0.c [2024-11-06 06:26:16,039 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 06:26:16,039 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 06:26:16,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 06:26:16,106 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;@470c73eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 06:26:16,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 06:26:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 06:26:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 06:26:16,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:16,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 06:26:16,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:16,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1944675641, now seen corresponding path program 1 times [2024-11-06 06:26:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934991066] [2024-11-06 06:26:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:16,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:26:16,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:16,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 06:26:16,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 06:26:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:17,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 06:26:17,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 06:26:17,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:26:17,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:26:17,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934991066] [2024-11-06 06:26:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934991066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:26:17,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:26:17,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 06:26:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423968694] [2024-11-06 06:26:17,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:26:17,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 06:26:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:26:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 06:26:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 06:26:17,197 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 06:26:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:26:17,212 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-11-06 06:26:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 06:26:17,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-06 06:26:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:26:17,219 INFO L225 Difference]: With dead ends: 35 [2024-11-06 06:26:17,219 INFO L226 Difference]: Without dead ends: 17 [2024-11-06 06:26:17,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 06:26:17,226 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 06:26:17,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 06:26:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-06 06:26:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-06 06:26:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 06:26:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-06 06:26:17,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 23 [2024-11-06 06:26:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:26:17,263 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-06 06:26:17,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 06:26:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-06 06:26:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 06:26:17,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:17,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 06:26:17,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 06:26:17,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:26:17,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:17,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash 265954675, now seen corresponding path program 1 times [2024-11-06 06:26:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:17,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400166340] [2024-11-06 06:26:17,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:17,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:26:17,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:17,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 06:26:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 06:26:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:18,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 06:26:18,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 06:26:18,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:26:18,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:26:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400166340] [2024-11-06 06:26:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400166340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:26:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:26:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 06:26:18,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509146710] [2024-11-06 06:26:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:26:18,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 06:26:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:26:18,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 06:26:18,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:26:18,865 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 06:26:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:26:19,623 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-06 06:26:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 06:26:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-11-06 06:26:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:26:19,625 INFO L225 Difference]: With dead ends: 27 [2024-11-06 06:26:19,625 INFO L226 Difference]: Without dead ends: 25 [2024-11-06 06:26:19,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:26:19,626 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 06:26:19,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 06:26:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-06 06:26:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-06 06:26:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 06:26:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-06 06:26:19,634 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-06 06:26:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:26:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-06 06:26:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 06:26:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-06 06:26:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 06:26:19,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:19,637 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-06 06:26:19,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 06:26:19,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:26:19,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 416519459, now seen corresponding path program 1 times [2024-11-06 06:26:19,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:19,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731606941] [2024-11-06 06:26:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:19,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:26:19,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:19,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 06:26:19,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 06:26:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:27,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-06 06:26:27,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 06:26:28,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:26:28,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:26:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731606941] [2024-11-06 06:26:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731606941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:26:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1109680373] [2024-11-06 06:26:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 06:26:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 06:26:28,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 06:26:28,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-06 06:26:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:31,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-06 06:26:31,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 06:26:31,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:26:32,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1109680373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:26:32,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 06:26:32,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-06 06:26:32,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370253243] [2024-11-06 06:26:32,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 06:26:32,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 06:26:32,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:26:32,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 06:26:32,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-06 06:26:32,129 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 06:26:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:26:34,051 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-06 06:26:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 06:26:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 44 [2024-11-06 06:26:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:26:34,053 INFO L225 Difference]: With dead ends: 36 [2024-11-06 06:26:34,053 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 06:26:34,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-06 06:26:34,055 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 06:26:34,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 98 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 06:26:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 06:26:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 06:26:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-06 06:26:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-06 06:26:34,064 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 44 [2024-11-06 06:26:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:26:34,065 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-06 06:26:34,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 06:26:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-06 06:26:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 06:26:34,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:34,068 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-06 06:26:34,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-06 06:26:34,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-06 06:26:34,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 06:26:34,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:34,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 223728499, now seen corresponding path program 2 times [2024-11-06 06:26:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:34,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131541450] [2024-11-06 06:26:34,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:26:34,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 06:26:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:34,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 06:26:34,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 06:26:46,631 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:26:46,632 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 06:26:46,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-06 06:26:46,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 06:26:50,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:26:56,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse15 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_351~0#1|)) (.cse8 (= |c_ULTIMATE.start_main_~state_370~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_338~0#1|)))) (let ((.cse12 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_13~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_12~0#1|)))))))) (.cse10 (not .cse8)) (.cse9 (forall ((|v_ULTIMATE.start_main_~var_341_arg_2~0#1_15| (_ BitVec 64))) (not (= (bvand |v_ULTIMATE.start_main_~var_341_arg_2~0#1_15| |c_ULTIMATE.start_main_~mask_SORT_3~0#1|) |c_ULTIMATE.start_main_~state_370~0#1|)))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_354_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_368_arg_1~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_395_arg_2~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_357_arg_1~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_395_arg_2~0#1_16|))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_354_arg_1~0#1_16|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_357_arg_1~0#1_17|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_368_arg_1~0#1_17|))))))))))))))))))))))) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_354_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_368_arg_1~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_395_arg_2~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_357_arg_1~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_354_arg_1~0#1_16|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_357_arg_1~0#1_17|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_368_arg_1~0#1_17|))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_395_arg_2~0#1_16|)))))))) (_ bv0 8)))) (.cse4 (forall ((|v_ULTIMATE.start_main_~var_393_arg_1~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_394~0#1|))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_393_arg_1~0#1_17|))))))))))) (_ bv0 8)))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_341_arg_2~0#1_15| (_ BitVec 64))) (= (bvand |v_ULTIMATE.start_main_~var_341_arg_2~0#1_15| |c_ULTIMATE.start_main_~mask_SORT_3~0#1|) |c_ULTIMATE.start_main_~state_370~0#1|)))) (and (or (let ((.cse7 (= ((_ extract 7 0) (bvand .cse11 (_ bv254 32))) (_ bv0 8)))) (let ((.cse5 (not .cse7))) (let ((.cse2 (and (or .cse9 .cse5) (or .cse10 .cse7))) (.cse1 (and (or .cse5 .cse6) (or .cse7 .cse8)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse2 .cse4) (or .cse4 .cse1))))) .cse12) (or (not .cse12) (let ((.cse13 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse11 (_ bv255 32)))))) (let ((.cse14 (not .cse13))) (and (or (and (or .cse10 .cse13) (or .cse9 .cse14)) (and .cse3 .cse4)) (or (and .cse0 .cse4) (and (or .cse6 .cse14) (or .cse13 .cse8)))))))))) is different from false [2024-11-06 06:26:56,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:26:56,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131541450] [2024-11-06 06:26:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131541450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:26:56,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [596161434] [2024-11-06 06:26:56,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:26:56,802 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 06:26:56,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 06:26:56,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 06:26:56,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-06 06:27:01,290 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:27:01,290 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 06:27:01,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-06 06:27:01,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:27:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 12 proven. 55 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-06 06:27:39,454 INFO L311 TraceCheckSpWp]: Computing backward predicates...