/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_w16_d64_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 06:24:50,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 06:24:50,358 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:24:50,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 06:24:50,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 06:24:50,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 06:24:50,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 06:24:50,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 06:24:50,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 06:24:50,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 06:24:50,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 06:24:50,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 06:24:50,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 06:24:50,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 06:24:50,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 06:24:50,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 06:24:50,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 06:24:50,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 06:24:50,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 06:24:50,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 06:24:50,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 06:24:50,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 06:24:50,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 06:24:50,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 06:24:50,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 06:24:50,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 06:24:50,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 06:24:50,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 06:24:50,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 06:24:50,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 06:24:50,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 06:24:50,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:24:50,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 06:24:50,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 06:24:50,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 06:24:50,401 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 06:24:50,401 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 06:24:50,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 06:24:50,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 06:24:50,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 06:24:50,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 06:24:50,402 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:24:50,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 06:24:50,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 06:24:50,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 06:24:50,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 06:24:50,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 06:24:50,613 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_w16_d64_e0.c [2024-11-06 06:24:51,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 06:24:52,170 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 06:24:52,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d64_e0.c [2024-11-06 06:24:52,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e39b01c/13d8fef04af64108947b89b26d637476/FLAG23650c228 [2024-11-06 06:24:52,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49e39b01c/13d8fef04af64108947b89b26d637476 [2024-11-06 06:24:52,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 06:24:52,208 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 06:24:52,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 06:24:52,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 06:24:52,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 06:24:52,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:52,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac1e0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52, skipping insertion in model container [2024-11-06 06:24:52,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:52,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 06:24:52,460 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_w16_d64_e0.c[1280,1293] [2024-11-06 06:24:52,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:24:52,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 06:24:52,808 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_w16_d64_e0.c[1280,1293] [2024-11-06 06:24:52,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:24:52,997 INFO L204 MainTranslator]: Completed translation [2024-11-06 06:24:52,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52 WrapperNode [2024-11-06 06:24:52,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 06:24:52,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 06:24:52,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 06:24:52,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 06:24:53,003 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:24:52" (1/1) ... [2024-11-06 06:24:53,046 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:24:52" (1/1) ... [2024-11-06 06:24:53,137 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2549 [2024-11-06 06:24:53,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 06:24:53,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 06:24:53,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 06:24:53,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 06:24:53,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,253 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:24:53,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 06:24:53,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 06:24:53,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 06:24:53,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 06:24:53,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (1/1) ... [2024-11-06 06:24:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:24:53,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 06:24:53,386 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:24:53,388 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:24:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 06:24:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 06:24:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 06:24:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 06:24:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 06:24:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 06:24:53,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 06:24:53,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 06:24:55,402 INFO L? ?]: Removed 705 outVars from TransFormulas that were not future-live. [2024-11-06 06:24:55,403 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 06:24:55,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 06:24:55,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 06:24:55,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:24:55 BoogieIcfgContainer [2024-11-06 06:24:55,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 06:24:55,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 06:24:55,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 06:24:55,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 06:24:55,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:24:52" (1/3) ... [2024-11-06 06:24:55,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6063a8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:24:55, skipping insertion in model container [2024-11-06 06:24:55,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:24:52" (2/3) ... [2024-11-06 06:24:55,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6063a8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:24:55, skipping insertion in model container [2024-11-06 06:24:55,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:24:55" (3/3) ... [2024-11-06 06:24:55,426 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d64_e0.c [2024-11-06 06:24:55,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 06:24:55,439 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 06:24:55,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 06:24:55,498 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;@4592cfae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 06:24:55,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 06:24:55,502 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:24:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 06:24:55,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:24:55,511 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:24:55,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:24:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:24:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1944675641, now seen corresponding path program 1 times [2024-11-06 06:24:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:24:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818726666] [2024-11-06 06:24:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:24:55,530 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:24:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:24:55,533 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:24:55,535 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:24:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:24:56,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 06:24:56,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:24:56,264 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:24:56,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:24:56,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:24:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818726666] [2024-11-06 06:24:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818726666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:24:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:24:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 06:24:56,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434859964] [2024-11-06 06:24:56,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:24:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 06:24:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:24:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 06:24:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 06:24:56,289 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:24:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:24:56,300 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-11-06 06:24:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 06:24:56,302 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:24:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:24:56,306 INFO L225 Difference]: With dead ends: 35 [2024-11-06 06:24:56,306 INFO L226 Difference]: Without dead ends: 17 [2024-11-06 06:24:56,308 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:24:56,310 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:24:56,311 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:24:56,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-06 06:24:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-06 06:24:56,336 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:24:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-06 06:24:56,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 23 [2024-11-06 06:24:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:24:56,343 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-06 06:24:56,344 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:24:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-06 06:24:56,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 06:24:56,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:24:56,345 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:24:56,362 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:24:56,550 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:24:56,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:24:56,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:24:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash 265954675, now seen corresponding path program 1 times [2024-11-06 06:24:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:24:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658956912] [2024-11-06 06:24:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:24:56,555 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:24:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:24:56,558 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:24:56,559 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:24:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:24:57,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 06:24:57,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:24:57,415 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:24:57,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:24:57,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:24:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658956912] [2024-11-06 06:24:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658956912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:24:57,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:24:57,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 06:24:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005271149] [2024-11-06 06:24:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:24:57,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 06:24:57,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:24:57,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 06:24:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:24:57,421 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:24:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:24:57,710 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-06 06:24:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 06:24:57,711 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:24:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:24:57,711 INFO L225 Difference]: With dead ends: 27 [2024-11-06 06:24:57,712 INFO L226 Difference]: Without dead ends: 25 [2024-11-06 06:24:57,712 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:24:57,713 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-06 06:24:57,713 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.3s Time] [2024-11-06 06:24:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-06 06:24:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-06 06:24:57,721 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:24:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-06 06:24:57,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-06 06:24:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:24:57,724 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-06 06:24:57,724 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:24:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-06 06:24:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 06:24:57,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:24:57,725 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:24:57,738 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:24:57,926 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:24:57,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:24:57,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:24:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 416519459, now seen corresponding path program 1 times [2024-11-06 06:24:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:24:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631529940] [2024-11-06 06:24:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:24:57,932 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:24:57,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:24:57,934 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:24:57,936 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:25:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:25:02,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-06 06:25:02,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:25:02,799 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:25:02,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:25:03,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:25:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631529940] [2024-11-06 06:25:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631529940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:25:03,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [838996755] [2024-11-06 06:25:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:25:03,049 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 06:25:03,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 06:25:03,072 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:25:03,073 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:25:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:25:05,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-06 06:25:05,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:25:05,512 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:25:05,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:25:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [838996755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:25:05,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 06:25:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-06 06:25:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381380204] [2024-11-06 06:25:05,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 06:25:05,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 06:25:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:25:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 06:25:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-06 06:25:05,612 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:25:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:25:06,444 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-06 06:25:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 06:25:06,447 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:25:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:25:06,447 INFO L225 Difference]: With dead ends: 36 [2024-11-06 06:25:06,447 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 06:25:06,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-06 06:25:06,449 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.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, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 06:25:06,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 98 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 06:25:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 06:25:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 06:25:06,457 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:25:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-06 06:25:06,458 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 44 [2024-11-06 06:25:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:25:06,458 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-06 06:25:06,459 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:25:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-06 06:25:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 06:25:06,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:25:06,462 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:25:06,485 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 (4)] Ended with exit code 0 [2024-11-06 06:25:06,686 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:25:06,863 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:25:06,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:25:06,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:25:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash 223728499, now seen corresponding path program 2 times [2024-11-06 06:25:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:25:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680466566] [2024-11-06 06:25:06,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:25:06,866 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:25:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:25:06,870 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:25:06,871 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:25:15,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:25:15,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 06:25:15,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-06 06:25:15,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:25:18,120 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:25:18,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:25:23,944 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_351~0#1|)) (.cse4 (forall ((|v_ULTIMATE.start_main_~var_393_arg_1~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse6 ((_ 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))))) (let ((.cse1 (and (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 .cse6 ((_ 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 .cse9 ((_ 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)) (.cse2 ((_ zero_extend 16) |c_ULTIMATE.start_main_~mask_SORT_3~0#1|)) (.cse3 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_370~0#1|))) (let ((.cse7 (= (_ 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|)))))))) (.cse5 (let ((.cse8 (= ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_338~0#1|))) .cse2))) .cse3))) (and (or .cse8 .cse1) (or (not .cse8) (and (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 .cse6 ((_ 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 .cse9 ((_ 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|)))))))))))))))))))))) .cse4)))))) (and (or (let ((.cse0 (= ((_ extract 7 0) (bvand .cse6 (_ bv254 32))) (_ bv0 8)))) (and (or (not .cse0) (and (or .cse1 (forall ((|v_ULTIMATE.start_main_~var_341_arg_2~0#1_15| (_ BitVec 16))) (= ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_341_arg_2~0#1_15|)))))) .cse3))) (or (forall ((|v_ULTIMATE.start_main_~var_341_arg_2~0#1_15| (_ BitVec 16))) (not (= ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse2 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_341_arg_2~0#1_15|)))))) .cse3))) .cse4))) (or .cse0 .cse5))) .cse7) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 (_ bv255 32)))) (not .cse7) .cse5)))))) is different from false [2024-11-06 06:25:24,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:25:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680466566] [2024-11-06 06:25:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680466566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:25:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1816762523] [2024-11-06 06:25:24,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:25:24,523 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 06:25:24,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 06:25:24,525 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:25:24,526 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:25:27,666 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:25:27,666 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 06:25:27,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-06 06:25:27,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:25:54,404 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:25:54,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:26:04,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_351~0#1|)) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_393_arg_1~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ 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_21|)))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_394~0#1|)))))))))))) (let ((.cse4 (and (forall ((|v_ULTIMATE.start_main_~var_357_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_368_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_354_arg_1~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_395_arg_2~0#1_20| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse1 ((_ 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 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_368_arg_1~0#1_21|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_354_arg_1~0#1_20|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_357_arg_1~0#1_21|)))))))))) (_ bv0 32))))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_395_arg_2~0#1_20|)))))))) (_ bv0 8))) .cse7)) (.cse5 ((_ zero_extend 16) |c_ULTIMATE.start_main_~mask_SORT_3~0#1|)) (.cse6 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_370~0#1|))) (let ((.cse0 (let ((.cse8 (= ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_338~0#1|))) .cse5))) .cse6))) (and (or (not .cse8) (and (forall ((|v_ULTIMATE.start_main_~var_357_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_368_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_354_arg_1~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_395_arg_2~0#1_20| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ 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 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_368_arg_1~0#1_21|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_354_arg_1~0#1_20|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_357_arg_1~0#1_21|)))))))))) (_ bv1 32))))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_395_arg_2~0#1_20|)))))))))) .cse7)) (or .cse8 .cse4)))) (.cse2 (= (_ 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|))))))))) (and (or .cse0 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 (_ bv255 32)))) (not .cse2)) (or (let ((.cse3 (= ((_ extract 7 0) (bvand .cse1 (_ bv254 32))) (_ bv0 8)))) (and (or (not .cse3) (and (or .cse4 (forall ((|v_ULTIMATE.start_main_~var_341_arg_2~0#1_19| (_ BitVec 16))) (= ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_341_arg_2~0#1_19|))) .cse5))) .cse6))) (or (forall ((|v_ULTIMATE.start_main_~var_341_arg_2~0#1_19| (_ BitVec 16))) (not (= ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_341_arg_2~0#1_19|))) .cse5))) .cse6))) .cse7))) (or .cse0 .cse3))) .cse2)))))) is different from false [2024-11-06 06:26:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1816762523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:26:05,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 06:26:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2024-11-06 06:26:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673566624] [2024-11-06 06:26:05,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 06:26:05,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-06 06:26:05,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:26:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-06 06:26:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=412, Unknown=3, NotChecked=82, Total=552 [2024-11-06 06:26:05,676 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 21 states, 16 states have (on average 2.6875) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-06 06:26:13,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 06:26:15,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 06:26:20,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 06:26:22,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []