/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:14:48,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:14:48,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 01:14:48,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:14:48,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:14:48,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:14:48,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:14:48,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:14:48,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:14:48,443 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:14:48,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:14:48,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:14:48,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:14:48,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:14:48,446 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:14:48,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:14:48,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:14:48,447 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:14:48,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:14:48,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:14:48,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:14:48,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:14:48,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:14:48,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:14:48,449 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:14:48,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:14:48,449 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:14:48,449 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:14:48,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:14:48,450 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:14:48,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:14:48,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:14:48,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:14:48,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:14:48,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:14:48,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:14:48,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:14:48,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:14:48,452 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:14:48,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:14:48,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:14:48,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:14:48,453 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:14:48,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:14:48,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:14:48,454 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:14:48,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 01:14:48,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:14:48,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:14:48,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:14:48,662 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:14:48,662 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:14:48,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2023-12-25 01:14:49,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:14:50,060 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:14:50,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2023-12-25 01:14:50,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456884e8a/76a60d2977f54c8b9e556323c0c0ba46/FLAGbf0f45a30 [2023-12-25 01:14:50,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456884e8a/76a60d2977f54c8b9e556323c0c0ba46 [2023-12-25 01:14:50,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:14:50,084 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:14:50,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:14:50,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:14:50,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:14:50,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e446a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50, skipping insertion in model container [2023-12-25 01:14:50,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,114 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:14:50,272 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i[951,964] [2023-12-25 01:14:50,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:14:50,292 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:14:50,303 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i[951,964] [2023-12-25 01:14:50,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:14:50,320 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:14:50,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50 WrapperNode [2023-12-25 01:14:50,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:14:50,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:14:50,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:14:50,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:14:50,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,349 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2023-12-25 01:14:50,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:14:50,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:14:50,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:14:50,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:14:50,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,373 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]. [2023-12-25 01:14:50,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:14:50,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:14:50,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:14:50,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:14:50,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (1/1) ... [2023-12-25 01:14:50,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:14:50,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:14:50,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 01:14:50,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 01:14:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:14:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:14:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:14:50,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:14:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:14:50,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:14:50,475 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:14:50,477 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:14:50,614 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:14:50,649 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:14:50,650 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 01:14:50,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:14:50 BoogieIcfgContainer [2023-12-25 01:14:50,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:14:50,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:14:50,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:14:50,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:14:50,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:14:50" (1/3) ... [2023-12-25 01:14:50,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4699ca6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:14:50, skipping insertion in model container [2023-12-25 01:14:50,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:14:50" (2/3) ... [2023-12-25 01:14:50,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4699ca6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:14:50, skipping insertion in model container [2023-12-25 01:14:50,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:14:50" (3/3) ... [2023-12-25 01:14:50,657 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound10.i [2023-12-25 01:14:50,668 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:14:50,668 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:14:50,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:14:50,711 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a5a7a47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:14:50,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:14:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:14:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 01:14:50,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:14:50,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:14:50,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:14:50,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:14:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash 334653711, now seen corresponding path program 1 times [2023-12-25 01:14:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:14:50,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836967353] [2023-12-25 01:14:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:14:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:14:50,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:14:50,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:14:50,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 01:14:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:14:50,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 01:14:50,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:14:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:14:50,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:14:50,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:14:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836967353] [2023-12-25 01:14:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836967353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:14:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:14:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 01:14:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129078638] [2023-12-25 01:14:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:14:50,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 01:14:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:14:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 01:14:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:14:50,867 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:14:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:14:50,887 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2023-12-25 01:14:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 01:14:50,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-25 01:14:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:14:50,894 INFO L225 Difference]: With dead ends: 34 [2023-12-25 01:14:50,894 INFO L226 Difference]: Without dead ends: 16 [2023-12-25 01:14:50,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 01:14:50,899 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:14:50,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:14:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-25 01:14:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-25 01:14:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:14:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-12-25 01:14:50,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2023-12-25 01:14:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:14:50,929 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-12-25 01:14:50,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:14:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-12-25 01:14:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 01:14:50,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:14:50,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:14:50,936 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 (2)] Ended with exit code 0 [2023-12-25 01:14:51,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:14:51,134 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:14:51,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:14:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -401566674, now seen corresponding path program 1 times [2023-12-25 01:14:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:14:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913291921] [2023-12-25 01:14:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:14:51,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:14:51,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:14:51,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:14:51,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 01:14:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:14:51,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 01:14:51,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:14:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:14:51,390 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:14:51,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:14:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913291921] [2023-12-25 01:14:51,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913291921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:14:51,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:14:51,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 01:14:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128518044] [2023-12-25 01:14:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:14:51,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:14:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:14:51,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:14:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-25 01:14:51,394 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:14:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:14:51,534 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-25 01:14:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 01:14:51,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-25 01:14:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:14:51,537 INFO L225 Difference]: With dead ends: 28 [2023-12-25 01:14:51,537 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 01:14:51,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:14:51,538 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:14:51,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:14:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 01:14:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-25 01:14:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:14:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-25 01:14:51,546 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2023-12-25 01:14:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:14:51,546 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-25 01:14:51,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:14:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-25 01:14:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 01:14:51,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:14:51,547 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:14:51,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 01:14:51,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:14:51,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:14:51,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:14:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1504476233, now seen corresponding path program 1 times [2023-12-25 01:14:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:14:51,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739884909] [2023-12-25 01:14:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:14:51,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:14:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:14:51,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:14:51,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:14:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:14:51,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 01:14:51,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:14:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:14:52,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:14:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:14:53,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:14:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739884909] [2023-12-25 01:14:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739884909] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:14:53,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:14:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-12-25 01:14:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157173640] [2023-12-25 01:14:53,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:14:53,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 01:14:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:14:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 01:14:53,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:14:53,020 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:14:57,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:01,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:15:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:02,778 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2023-12-25 01:15:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:15:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-25 01:15:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:02,781 INFO L225 Difference]: With dead ends: 59 [2023-12-25 01:15:02,781 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 01:15:02,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-12-25 01:15:02,784 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:02,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 95 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-12-25 01:15:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 01:15:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2023-12-25 01:15:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 01:15:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-12-25 01:15:02,797 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 12 [2023-12-25 01:15:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:02,798 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-12-25 01:15:02,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-12-25 01:15:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:15:02,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:02,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:02,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:03,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:03,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:03,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1989427041, now seen corresponding path program 1 times [2023-12-25 01:15:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:03,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908859971] [2023-12-25 01:15:03,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:15:03,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:03,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:03,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:03,007 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 (5)] Waiting until timeout for monitored process [2023-12-25 01:15:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:15:03,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 01:15:03,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:15:03,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:15:03,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908859971] [2023-12-25 01:15:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908859971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:15:03,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:15:03,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 01:15:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939318150] [2023-12-25 01:15:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:15:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 01:15:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 01:15:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:15:03,073 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:15:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:03,106 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2023-12-25 01:15:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 01:15:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-25 01:15:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:03,111 INFO L225 Difference]: With dead ends: 65 [2023-12-25 01:15:03,112 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 01:15:03,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 01:15:03,116 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:03,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 01:15:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 01:15:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 01:15:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:15:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2023-12-25 01:15:03,131 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 18 [2023-12-25 01:15:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:03,131 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2023-12-25 01:15:03,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 01:15:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2023-12-25 01:15:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 01:15:03,132 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:03,132 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:03,142 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 (5)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:03,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:03,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1842785254, now seen corresponding path program 2 times [2023-12-25 01:15:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211788365] [2023-12-25 01:15:03,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:15:03,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:03,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:03,343 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) [2023-12-25 01:15:03,345 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 [2023-12-25 01:15:03,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 01:15:03,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:15:03,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 01:15:03,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 01:15:03,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:15:03,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:03,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211788365] [2023-12-25 01:15:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211788365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:15:03,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:15:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 01:15:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295815167] [2023-12-25 01:15:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:15:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:15:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:15:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:15:03,524 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:03,696 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2023-12-25 01:15:03,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 01:15:03,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-25 01:15:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:03,699 INFO L225 Difference]: With dead ends: 57 [2023-12-25 01:15:03,699 INFO L226 Difference]: Without dead ends: 54 [2023-12-25 01:15:03,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 01:15:03,700 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:03,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:15:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-25 01:15:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-12-25 01:15:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:15:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-25 01:15:03,712 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 18 [2023-12-25 01:15:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:03,712 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-25 01:15:03,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:15:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-25 01:15:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 01:15:03,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:03,714 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:03,720 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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:03,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:03,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash 653827799, now seen corresponding path program 1 times [2023-12-25 01:15:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034135997] [2023-12-25 01:15:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:15:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:03,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:03,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:03,919 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 (7)] Waiting until timeout for monitored process [2023-12-25 01:15:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:15:03,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 01:15:03,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:15:04,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:15:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 01:15:06,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034135997] [2023-12-25 01:15:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034135997] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:15:06,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:15:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-25 01:15:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895712593] [2023-12-25 01:15:06,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:15:06,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:15:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:15:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:15:06,286 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:15:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:12,968 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2023-12-25 01:15:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 01:15:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-25 01:15:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:12,971 INFO L225 Difference]: With dead ends: 117 [2023-12-25 01:15:12,971 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 01:15:12,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2023-12-25 01:15:12,973 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:12,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 193 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 01:15:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 01:15:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2023-12-25 01:15:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 66 states have internal predecessors, (76), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:15:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2023-12-25 01:15:12,997 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 22 [2023-12-25 01:15:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:12,997 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2023-12-25 01:15:12,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:15:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2023-12-25 01:15:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:15:12,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:12,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:13,005 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:13,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:13,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:13,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1620400559, now seen corresponding path program 2 times [2023-12-25 01:15:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011791120] [2023-12-25 01:15:13,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:15:13,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:13,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:13,207 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:13,208 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 (8)] Waiting until timeout for monitored process [2023-12-25 01:15:13,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:15:13,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:15:13,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 01:15:13,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:15:13,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:15:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 01:15:13,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011791120] [2023-12-25 01:15:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011791120] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:15:13,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:15:13,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2023-12-25 01:15:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374111818] [2023-12-25 01:15:13,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:15:13,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:15:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:13,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:15:13,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:15:13,361 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:15:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:13,439 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2023-12-25 01:15:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:15:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2023-12-25 01:15:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:13,442 INFO L225 Difference]: With dead ends: 122 [2023-12-25 01:15:13,442 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 01:15:13,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 01:15:13,443 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:13,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 01:15:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 01:15:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-12-25 01:15:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 55 states have internal predecessors, (63), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:15:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-12-25 01:15:13,461 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 28 [2023-12-25 01:15:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:13,461 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-12-25 01:15:13,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:15:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-12-25 01:15:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 01:15:13,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:13,462 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:13,471 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:13,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:13,666 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:13,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 263511235, now seen corresponding path program 3 times [2023-12-25 01:15:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:13,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633103859] [2023-12-25 01:15:13,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:15:13,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:13,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:13,684 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 (9)] Waiting until timeout for monitored process [2023-12-25 01:15:13,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-25 01:15:13,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:15:13,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:15:13,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:15:14,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:15:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 01:15:19,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633103859] [2023-12-25 01:15:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633103859] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:15:19,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:15:19,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-25 01:15:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272209129] [2023-12-25 01:15:19,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:15:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 01:15:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:19,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 01:15:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:15:19,391 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:15:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:15:21,119 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-12-25 01:15:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:15:21,120 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-12-25 01:15:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:15:21,120 INFO L225 Difference]: With dead ends: 102 [2023-12-25 01:15:21,121 INFO L226 Difference]: Without dead ends: 98 [2023-12-25 01:15:21,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:15:21,122 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:15:21,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 148 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 01:15:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-25 01:15:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2023-12-25 01:15:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 01:15:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2023-12-25 01:15:21,143 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 30 [2023-12-25 01:15:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:15:21,143 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2023-12-25 01:15:21,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 01:15:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2023-12-25 01:15:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 01:15:21,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:15:21,145 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 01:15:21,152 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 01:15:21,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:21,348 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:15:21,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:15:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1673092517, now seen corresponding path program 4 times [2023-12-25 01:15:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:15:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489754012] [2023-12-25 01:15:21,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 01:15:21,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:15:21,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:15:21,349 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:15:21,350 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 (10)] Waiting until timeout for monitored process [2023-12-25 01:15:21,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 01:15:21,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:15:21,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 01:15:21,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:15:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:15:22,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:15:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 01:15:37,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:15:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489754012] [2023-12-25 01:15:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489754012] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:15:37,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:15:37,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-25 01:15:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019769930] [2023-12-25 01:15:37,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:15:37,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 01:15:37,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:15:37,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 01:15:37,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-12-25 01:15:37,519 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:15:59,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:03,238 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 [] [2023-12-25 01:16:08,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:26,427 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 [] [2023-12-25 01:16:30,875 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 [] [2023-12-25 01:16:33,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:35,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:16:43,109 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 [] [2023-12-25 01:16:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:16:43,175 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2023-12-25 01:16:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 01:16:43,178 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2023-12-25 01:16:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:16:43,179 INFO L225 Difference]: With dead ends: 169 [2023-12-25 01:16:43,179 INFO L226 Difference]: Without dead ends: 130 [2023-12-25 01:16:43,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=419, Invalid=1561, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 01:16:43,181 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 113 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 71 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:16:43,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 248 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 424 Invalid, 5 Unknown, 0 Unchecked, 36.3s Time] [2023-12-25 01:16:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-25 01:16:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2023-12-25 01:16:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 92 states have internal predecessors, (100), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 11 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 01:16:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2023-12-25 01:16:43,222 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 32 [2023-12-25 01:16:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:16:43,222 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2023-12-25 01:16:43,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:16:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2023-12-25 01:16:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 01:16:43,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:16:43,224 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:16:43,230 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 01:16:43,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:43,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:16:43,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:16:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1466163010, now seen corresponding path program 1 times [2023-12-25 01:16:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:16:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009634936] [2023-12-25 01:16:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:16:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:16:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:16:43,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:16:43,431 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 (11)] Waiting until timeout for monitored process [2023-12-25 01:16:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:16:43,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 01:16:43,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:16:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 01:16:44,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:17:06,741 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 01:17:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 01:17:10,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:17:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009634936] [2023-12-25 01:17:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009634936] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:17:10,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:17:10,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2023-12-25 01:17:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341780881] [2023-12-25 01:17:10,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:17:10,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 01:17:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:17:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 01:17:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-12-25 01:17:10,918 INFO L87 Difference]: Start difference. First operand 113 states and 136 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 22 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:17:19,186 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 42 DAG size of output: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:17:22,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:26,827 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 [] [2023-12-25 01:17:37,758 WARN L293 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 53 DAG size of output: 26 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:17:41,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:45,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:49,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:17:53,300 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 [] [2023-12-25 01:17:59,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:03,892 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 [] [2023-12-25 01:18:08,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:12,126 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 [] [2023-12-25 01:18:16,362 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 [] [2023-12-25 01:18:18,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:21,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:18:23,931 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2023-12-25 01:18:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 01:18:23,931 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 22 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2023-12-25 01:18:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:18:23,934 INFO L225 Difference]: With dead ends: 181 [2023-12-25 01:18:23,934 INFO L226 Difference]: Without dead ends: 119 [2023-12-25 01:18:23,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 01:18:23,935 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 42 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:18:23,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 224 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 388 Invalid, 8 Unknown, 0 Unchecked, 46.6s Time] [2023-12-25 01:18:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-25 01:18:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2023-12-25 01:18:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.146341463414634) internal successors, (94), 87 states have internal predecessors, (94), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 01:18:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2023-12-25 01:18:23,986 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 34 [2023-12-25 01:18:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:18:23,987 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2023-12-25 01:18:23,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 22 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 01:18:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2023-12-25 01:18:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 01:18:23,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:18:23,994 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 01:18:23,998 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 01:18:24,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:18:24,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:18:24,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:18:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1670815805, now seen corresponding path program 5 times [2023-12-25 01:18:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:18:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615533325] [2023-12-25 01:18:24,199 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 01:18:24,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:18:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:18:24,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:18:24,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 01:18:24,289 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-25 01:18:24,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:18:24,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 01:18:24,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:18:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:18:24,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:18:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 01:18:24,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:18:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615533325] [2023-12-25 01:18:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615533325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:18:24,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:18:24,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2023-12-25 01:18:24,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189032289] [2023-12-25 01:18:24,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:18:24,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 01:18:24,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:18:24,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 01:18:24,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:18:24,612 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:18:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:18:24,847 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2023-12-25 01:18:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:18:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-12-25 01:18:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:18:24,849 INFO L225 Difference]: With dead ends: 120 [2023-12-25 01:18:24,849 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 01:18:24,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 01:18:24,850 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:18:24,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 99 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 01:18:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 01:18:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-25 01:18:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 76 states have internal predecessors, (82), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-25 01:18:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2023-12-25 01:18:24,881 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 38 [2023-12-25 01:18:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:18:24,881 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2023-12-25 01:18:24,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:18:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2023-12-25 01:18:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 01:18:24,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:18:24,882 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:18:24,886 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 (12)] Forceful destruction successful, exit code 0 [2023-12-25 01:18:25,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:18:25,083 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:18:25,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:18:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1330789361, now seen corresponding path program 2 times [2023-12-25 01:18:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:18:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14145404] [2023-12-25 01:18:25,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:18:25,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:18:25,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:18:25,086 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:18:25,087 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 (13)] Waiting until timeout for monitored process [2023-12-25 01:18:25,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:18:25,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:18:25,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 01:18:25,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:18:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 01:18:26,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:18:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 01:18:37,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:18:37,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14145404] [2023-12-25 01:18:37,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14145404] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:18:37,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:18:37,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2023-12-25 01:18:37,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641958602] [2023-12-25 01:18:37,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:18:37,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 01:18:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:18:37,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 01:18:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2023-12-25 01:18:37,894 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 27 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:18:49,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:18:53,479 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 [] [2023-12-25 01:18:54,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:08,075 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 [] [2023-12-25 01:19:10,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:19,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:23,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:26,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:35,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:19:47,821 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:19:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:51,457 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2023-12-25 01:19:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 01:19:51,466 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 27 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-12-25 01:19:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:51,467 INFO L225 Difference]: With dead ends: 126 [2023-12-25 01:19:51,467 INFO L226 Difference]: Without dead ends: 124 [2023-12-25 01:19:51,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=406, Invalid=1664, Unknown=0, NotChecked=0, Total=2070 [2023-12-25 01:19:51,468 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 53 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:51,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 299 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 522 Invalid, 6 Unknown, 0 Unchecked, 37.0s Time] [2023-12-25 01:19:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-25 01:19:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2023-12-25 01:19:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 93 states have internal predecessors, (101), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 14 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 01:19:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2023-12-25 01:19:51,512 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 42 [2023-12-25 01:19:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:51,512 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2023-12-25 01:19:51,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 27 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 01:19:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2023-12-25 01:19:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 01:19:51,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:51,513 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:51,517 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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:51,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:51,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:51,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash 466354955, now seen corresponding path program 6 times [2023-12-25 01:19:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:51,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103333482] [2023-12-25 01:19:51,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 01:19:51,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:51,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:51,716 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:51,718 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 (14)] Waiting until timeout for monitored process [2023-12-25 01:19:51,804 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-25 01:19:51,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:19:51,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 01:19:51,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:19:52,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:19:52,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103333482] [2023-12-25 01:19:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103333482] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:19:52,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:19:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2023-12-25 01:19:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685347405] [2023-12-25 01:19:52,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:19:52,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 01:19:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 01:19:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:19:52,644 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:19:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:53,480 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2023-12-25 01:19:53,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 01:19:53,485 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 48 [2023-12-25 01:19:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:53,486 INFO L225 Difference]: With dead ends: 139 [2023-12-25 01:19:53,487 INFO L226 Difference]: Without dead ends: 75 [2023-12-25 01:19:53,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2023-12-25 01:19:53,489 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:53,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 224 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 01:19:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-25 01:19:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2023-12-25 01:19:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 57 states have internal predecessors, (62), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 01:19:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2023-12-25 01:19:53,519 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 48 [2023-12-25 01:19:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:53,519 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2023-12-25 01:19:53,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:19:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2023-12-25 01:19:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:19:53,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:19:53,520 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:19:53,526 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:53,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:53,726 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:19:53,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:19:53,726 INFO L85 PathProgramCache]: Analyzing trace with hash 408340823, now seen corresponding path program 3 times [2023-12-25 01:19:53,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:19:53,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805658920] [2023-12-25 01:19:53,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:19:53,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:53,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:19:53,727 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 01:19:53,729 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 (15)] Waiting until timeout for monitored process [2023-12-25 01:19:54,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-25 01:19:54,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:19:54,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 01:19:54,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:19:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 01:19:55,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:19:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 01:19:55,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:19:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805658920] [2023-12-25 01:19:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805658920] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:19:55,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:19:55,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2023-12-25 01:19:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673241074] [2023-12-25 01:19:55,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:19:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 01:19:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:19:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 01:19:55,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:19:55,648 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 01:19:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:19:56,461 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-12-25 01:19:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 01:19:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 58 [2023-12-25 01:19:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:19:56,464 INFO L225 Difference]: With dead ends: 78 [2023-12-25 01:19:56,464 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 01:19:56,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 01:19:56,465 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 59 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:19:56,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 235 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 01:19:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 01:19:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 01:19:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 01:19:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 01:19:56,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2023-12-25 01:19:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:19:56,466 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 01:19:56,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 01:19:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 01:19:56,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 01:19:56,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:19:56,477 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 01:19:56,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 01:19:56,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 01:20:23,784 WARN L293 SmtUtils]: Spent 26.89s on a formula simplification. DAG size of input: 140 DAG size of output: 10 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 01:20:26,243 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 01:20:26,243 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-25 01:20:26,243 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-12-25 01:20:26,244 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 01:20:26,244 INFO L895 garLoopResultBuilder]: At program point L38-1(lines 38 47) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~A~0#1| (_ bv10 32)) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|)) [2023-12-25 01:20:26,244 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 37) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse1 (bvule |ULTIMATE.start_main_~r~0#1| (_ bv10 32))) (.cse2 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse3 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))) (or (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv4 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv8 32))) (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv8 32)) (bvule |ULTIMATE.start_main_~A~0#1| (_ bv10 32)) .cse2 .cse3 (= (_ bv16 32) |ULTIMATE.start_main_~b~0#1|)) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse1 .cse2 .cse3 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse1 .cse2 .cse3))) [2023-12-25 01:20:26,244 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-12-25 01:20:26,244 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2023-12-25 01:20:26,244 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 38 47) the Hoare annotation is: (let ((.cse19 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) (.cse20 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv8 32)))) (let ((.cse3 (bvuge .cse20 (_ bv8 32))) (.cse4 (= |ULTIMATE.start_main_~A~0#1| .cse20)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) (.cse11 (= |ULTIMATE.start_main_~b~0#1| (_ bv8 32))) (.cse13 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) (.cse14 (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv4 32))) (.cse10 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32))) (.cse15 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv8 32))) (.cse2 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv10 32))) (.cse1 (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|)) (.cse18 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv4 32))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse6 (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse16 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse17 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse7 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~q~0#1|) .cse6 .cse7 .cse4) (let ((.cse8 (bvadd (_ bv4 32) |ULTIMATE.start_main_~r~0#1|))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~A~0#1| .cse8) (exists ((|v_ULTIMATE.start_main_~b~0#1_40| (_ BitVec 32))) (let ((.cse9 (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~b~0#1_40|))) (and (not (bvuge .cse8 .cse9)) (= (_ bv4 32) (bvudiv .cse9 (_ bv2 32)))))) (bvuge .cse8 (_ bv4 32)) .cse10)) (and .cse0 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv10 32))) .cse2 .cse6 (= |ULTIMATE.start_main_~q~0#1| (_ bv5 32)) .cse7) (and .cse0 .cse2 .cse3 .cse11 .cse4 .cse10) (and .cse0 .cse6 (let ((.cse12 (not (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv8 32))))) (or (and .cse12 (bvuge .cse13 (_ bv2 32)) .cse14 (= |ULTIMATE.start_main_~q~0#1| (_ bv3 32))) (and .cse12 .cse14 .cse5))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) |ULTIMATE.start_main_~A~0#1|)) (and (not .cse15) .cse0 .cse16 .cse17 .cse18 .cse11) (and .cse0 (= |ULTIMATE.start_main_~A~0#1| .cse13) (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv2 32)) .cse6 (not .cse14) .cse10) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse2 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))) (and .cse0 .cse15 .cse2 .cse16 .cse17 (= (_ bv16 32) |ULTIMATE.start_main_~b~0#1|)) (and .cse0 .cse1 (not .cse18) .cse16 .cse17 .cse19) (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) .cse6 .cse16 .cse17 .cse7)))) [2023-12-25 01:20:26,245 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse19 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) (.cse20 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv8 32)))) (let ((.cse3 (bvuge .cse20 (_ bv8 32))) (.cse4 (= |ULTIMATE.start_main_~A~0#1| .cse20)) (.cse5 (= |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) (.cse11 (= |ULTIMATE.start_main_~b~0#1| (_ bv8 32))) (.cse13 (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv2 32))) (.cse14 (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv4 32))) (.cse10 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32))) (.cse15 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv8 32))) (.cse2 (bvule |ULTIMATE.start_main_~A~0#1| (_ bv10 32))) (.cse1 (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|)) (.cse18 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv4 32))) (.cse0 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse6 (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse16 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse17 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse7 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~q~0#1|) .cse6 .cse7 .cse4) (let ((.cse8 (bvadd (_ bv4 32) |ULTIMATE.start_main_~r~0#1|))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~A~0#1| .cse8) (exists ((|v_ULTIMATE.start_main_~b~0#1_40| (_ BitVec 32))) (let ((.cse9 (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~b~0#1_40|))) (and (not (bvuge .cse8 .cse9)) (= (_ bv4 32) (bvudiv .cse9 (_ bv2 32)))))) (bvuge .cse8 (_ bv4 32)) .cse10)) (and .cse0 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| (_ bv10 32))) .cse2 .cse6 (= |ULTIMATE.start_main_~q~0#1| (_ bv5 32)) .cse7) (and .cse0 .cse2 .cse3 .cse11 .cse4 .cse10) (and .cse0 .cse6 (let ((.cse12 (not (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv8 32))))) (or (and .cse12 (bvuge .cse13 (_ bv2 32)) .cse14 (= |ULTIMATE.start_main_~q~0#1| (_ bv3 32))) (and .cse12 .cse14 .cse5))) (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| (_ bv2 32))) |ULTIMATE.start_main_~A~0#1|)) (and (not .cse15) .cse0 .cse16 .cse17 .cse18 .cse11) (and .cse0 (= |ULTIMATE.start_main_~A~0#1| .cse13) (bvuge |ULTIMATE.start_main_~A~0#1| (_ bv2 32)) .cse6 (not .cse14) .cse10) (and .cse0 (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse2 (= |ULTIMATE.start_main_~A~0#1| (bvadd |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~q~0#1|))) (and .cse0 .cse15 .cse2 .cse16 .cse17 (= (_ bv16 32) |ULTIMATE.start_main_~b~0#1|)) (and .cse0 .cse1 (not .cse18) .cse16 .cse17 .cse19) (and .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) .cse6 .cse16 .cse17 .cse7)))) [2023-12-25 01:20:26,245 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2023-12-25 01:20:26,245 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-12-25 01:20:26,245 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2023-12-25 01:20:26,245 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2023-12-25 01:20:26,245 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 24) the Hoare annotation is: true [2023-12-25 01:20:26,245 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2023-12-25 01:20:26,245 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2023-12-25 01:20:26,245 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-12-25 01:20:26,248 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 2, 1, 1, 1] [2023-12-25 01:20:26,250 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:20:26,270 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~b~0#1_40 : bv32 :: !~bvuge~32(~bvadd~32(4bv32, ~r~0), ~bvmul~32(2bv32, v_ULTIMATE.start_main_~b~0#1_40)) && 4bv32 == ~bvudiv~32(~bvmul~32(2bv32, v_ULTIMATE.start_main_~b~0#1_40), 2bv32)) could not be translated [2023-12-25 01:20:26,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:20:26 BoogieIcfgContainer [2023-12-25 01:20:26,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:20:26,274 INFO L158 Benchmark]: Toolchain (without parser) took 336190.54ms. Allocated memory was 185.6MB in the beginning and 260.0MB in the end (delta: 74.4MB). Free memory was 130.6MB in the beginning and 146.7MB in the end (delta: -16.1MB). Peak memory consumption was 133.1MB. Max. memory is 8.0GB. [2023-12-25 01:20:26,274 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 185.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:20:26,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.25ms. Allocated memory is still 185.6MB. Free memory was 130.3MB in the beginning and 119.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:20:26,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.96ms. Allocated memory is still 185.6MB. Free memory was 119.0MB in the beginning and 117.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:20:26,275 INFO L158 Benchmark]: Boogie Preprocessor took 33.92ms. Allocated memory is still 185.6MB. Free memory was 117.4MB in the beginning and 115.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:20:26,275 INFO L158 Benchmark]: RCFGBuilder took 265.93ms. Allocated memory was 185.6MB in the beginning and 260.0MB in the end (delta: 74.4MB). Free memory was 115.6MB in the beginning and 230.2MB in the end (delta: -114.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2023-12-25 01:20:26,275 INFO L158 Benchmark]: TraceAbstraction took 335621.67ms. Allocated memory is still 260.0MB. Free memory was 229.7MB in the beginning and 146.7MB in the end (delta: 83.0MB). Peak memory consumption was 156.9MB. Max. memory is 8.0GB. [2023-12-25 01:20:26,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 185.6MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.25ms. Allocated memory is still 185.6MB. Free memory was 130.3MB in the beginning and 119.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.96ms. Allocated memory is still 185.6MB. Free memory was 119.0MB in the beginning and 117.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.92ms. Allocated memory is still 185.6MB. Free memory was 117.4MB in the beginning and 115.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.93ms. Allocated memory was 185.6MB in the beginning and 260.0MB in the end (delta: 74.4MB). Free memory was 115.6MB in the beginning and 230.2MB in the end (delta: -114.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * TraceAbstraction took 335621.67ms. Allocated memory is still 260.0MB. Free memory was 229.7MB in the beginning and 146.7MB in the end (delta: 83.0MB). Peak memory consumption was 156.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~b~0#1_40 : bv32 :: !~bvuge~32(~bvadd~32(4bv32, ~r~0), ~bvmul~32(2bv32, v_ULTIMATE.start_main_~b~0#1_40)) && 4bv32 == ~bvudiv~32(~bvmul~32(2bv32, v_ULTIMATE.start_main_~b~0#1_40), 2bv32)) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 335.6s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 232.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 539 SdHoareTripleChecker+Valid, 133.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 511 mSDsluCounter, 1966 SdHoareTripleChecker+Invalid, 131.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1731 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2664 IncrementalHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 235 mSDtfsCounter, 2664 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 538 SyntacticMatches, 2 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1694 ImplicationChecksByTransitivity, 128.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=12, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 86 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 80 PreInvPairs, 145 NumberOfFragments, 671 HoareAnnotationTreeSize, 80 FormulaSimplifications, 21502 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FormulaSimplificationsInter, 1403 FormulaSimplificationTreeSizeReductionInter, 29.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 68.2s InterpolantComputationTime, 399 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 719 ConstructedInterpolants, 20 QuantifiedInterpolants, 6819 SizeOfPredicates, 41 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 24 InterpolantComputations, 4 PerfectInterpolantSequences, 494/892 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((((((B == 1) && (4 == b)) && (A <= 10)) && (((r + 8) % 4294967296) >= 8)) && (A == ((r + 8) % 4294967296))) && (q == 2)) || (((((B == 1) && (4 == q)) && (b == 2)) && !((r >= 2))) && (A == ((r + 8) % 4294967296)))) || (((((B == 1) && (4 == b)) && (A == ((4 + r) % 4294967296))) && (((4 + r) % 4294967296) >= 4)) && (q == 1))) || ((((((B == 1) && (A == ((r + 10) % 4294967296))) && (A <= 10)) && (b == 2)) && (q == 5)) && !((r >= 2)))) || ((((((B == 1) && (A <= 10)) && (((r + 8) % 4294967296) >= 8)) && (b == 8)) && (A == ((r + 8) % 4294967296))) && (q == 1))) || ((((B == 1) && (b == 2)) && ((((!((A >= 8)) && (((r + 2) % 4294967296) >= 2)) && (A >= 4)) && (q == 3)) || ((!((A >= 8)) && (A >= 4)) && (q == 2)))) && (((r + (q * 2)) % 4294967296) == A))) || (((((!((r >= 8)) && (B == 1)) && (r == A)) && (q == 0)) && (r >= 4)) && (b == 8))) || ((((((B == 1) && (A == ((r + 2) % 4294967296))) && (A >= 2)) && (b == 2)) && !((A >= 4))) && (q == 1))) || ((((B == 1) && (b == 1)) && (A <= 10)) && (A == ((r + q) % 4294967296)))) || ((((((B == 1) && (r >= 8)) && (A <= 10)) && (r == A)) && (q == 0)) && (16 == b))) || ((((((B == 1) && (4 == b)) && !((r >= 4))) && (r == A)) && (q == 0)) && (r >= 2))) || ((((((B == 1) && (r >= 1)) && (b == 2)) && (r == A)) && (q == 0)) && !((r >= 2)))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((B == 1) && (r >= 1)) && (b == 2)) && (r <= 10)) && (r == A)) && (q == 0)) || ((((((B == 1) && (r <= 10)) && (r == A)) && (q == 0)) && (r >= 4)) && (b == 8))) || ((((((B == 1) && (r >= 8)) && (A <= 10)) && (r == A)) && (q == 0)) && (16 == b))) || ((((((B == 1) && (4 == b)) && (r <= 10)) && (r == A)) && (q == 0)) && (r >= 2))) || (((((B == 1) && (b == 1)) && (r <= 10)) && (r == A)) && (q == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-25 01:20:26,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...