/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_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:47:28,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:47:28,265 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-16 16:47:28,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:47:28,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:47:28,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:47:28,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:47:28,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:47:28,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:47:28,302 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:47:28,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:47:28,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:47:28,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:47:28,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:47:28,305 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:47:28,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:47:28,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:47:28,306 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:47:28,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:47:28,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:47:28,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:47:28,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:47:28,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:47:28,307 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:47:28,307 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:47:28,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:47:28,308 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:47:28,308 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:47:28,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:47:28,308 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:47:28,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:47:28,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:47:28,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:47:28,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:47:28,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:47:28,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:47:28,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:47:28,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:47:28,311 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:47:28,311 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:47:28,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:47:28,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:47:28,311 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:47:28,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:47:28,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:47:28,312 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:47:28,312 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-16 16:47:28,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:47:28,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:47:28,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:47:28,585 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:47:28,585 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:47:28,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2023-12-16 16:47:29,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:47:30,022 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:47:30,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound2.i [2023-12-16 16:47:30,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f466f9bf7/89d51c66a2fd4155bd0353a7119ead21/FLAGcabf84936 [2023-12-16 16:47:30,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f466f9bf7/89d51c66a2fd4155bd0353a7119ead21 [2023-12-16 16:47:30,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:47:30,045 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:47:30,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:47:30,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:47:30,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:47:30,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634f5b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30, skipping insertion in model container [2023-12-16 16:47:30,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,069 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:47:30,221 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_unwindbound2.i[951,964] [2023-12-16 16:47:30,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:47:30,250 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:47:30,261 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_unwindbound2.i[951,964] [2023-12-16 16:47:30,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:47:30,287 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:47:30,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30 WrapperNode [2023-12-16 16:47:30,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:47:30,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:47:30,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:47:30,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:47:30,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,320 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2023-12-16 16:47:30,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:47:30,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:47:30,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:47:30,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:47:30,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,338 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-16 16:47:30,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:47:30,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:47:30,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:47:30,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:47:30,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (1/1) ... [2023-12-16 16:47:30,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:47:30,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:47:30,393 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-16 16:47:30,395 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-16 16:47:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:47:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:47:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:47:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:47:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 16:47:30,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 16:47:30,459 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:47:30,460 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:47:30,585 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:47:30,609 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:47:30,609 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:47:30,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:47:30 BoogieIcfgContainer [2023-12-16 16:47:30,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:47:30,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:47:30,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:47:30,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:47:30,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:47:30" (1/3) ... [2023-12-16 16:47:30,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17efeb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:47:30, skipping insertion in model container [2023-12-16 16:47:30,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:47:30" (2/3) ... [2023-12-16 16:47:30,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17efeb4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:47:30, skipping insertion in model container [2023-12-16 16:47:30,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:47:30" (3/3) ... [2023-12-16 16:47:30,617 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound2.i [2023-12-16 16:47:30,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:47:30,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:47:30,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:47:30,675 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;@58cca52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:47:30,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:47:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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-16 16:47:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:47:30,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:30,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:30,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:30,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash 774102990, now seen corresponding path program 1 times [2023-12-16 16:47:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064940729] [2023-12-16 16:47:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:30,710 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-16 16:47:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:30,712 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-16 16:47:30,714 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-16 16:47:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:30,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:47:30,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:30,795 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-16 16:47:30,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:30,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064940729] [2023-12-16 16:47:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064940729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:30,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:30,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:47:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432982521] [2023-12-16 16:47:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:30,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:47:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:30,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:47:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:47:30,828 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 16:47:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:30,848 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2023-12-16 16:47:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:47:30,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2023-12-16 16:47:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:30,855 INFO L225 Difference]: With dead ends: 32 [2023-12-16 16:47:30,855 INFO L226 Difference]: Without dead ends: 16 [2023-12-16 16:47:30,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-16 16:47:30,860 INFO L413 NwaCegarLoop]: 21 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, 21 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-16 16:47:30,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-16 16:47:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-16 16:47:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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-16 16:47:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2023-12-16 16:47:30,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 7 [2023-12-16 16:47:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:30,888 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2023-12-16 16:47:30,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 16:47:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2023-12-16 16:47:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:47:30,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:30,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:30,914 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-16 16:47:31,090 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-16 16:47:31,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:31,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1084410172, now seen corresponding path program 1 times [2023-12-16 16:47:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983772653] [2023-12-16 16:47:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:31,092 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-16 16:47:31,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:31,094 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-16 16:47:31,095 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-16 16:47:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:31,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:47:31,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:31,169 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-16 16:47:31,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:31,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983772653] [2023-12-16 16:47:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983772653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:31,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:47:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223863242] [2023-12-16 16:47:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:31,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:47:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:31,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:47:31,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:47:31,173 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-16 16:47:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:31,192 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-12-16 16:47:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:47:31,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-16 16:47:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:31,194 INFO L225 Difference]: With dead ends: 30 [2023-12-16 16:47:31,194 INFO L226 Difference]: Without dead ends: 18 [2023-12-16 16:47:31,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:47:31,196 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:31,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-16 16:47:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-16 16:47:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-16 16:47:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-16 16:47:31,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2023-12-16 16:47:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:31,202 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-16 16:47:31,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-16 16:47:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-16 16:47:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:47:31,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:31,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:31,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 16:47:31,407 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-16 16:47:31,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:31,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1068718015, now seen corresponding path program 1 times [2023-12-16 16:47:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119901984] [2023-12-16 16:47:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:31,409 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-16 16:47:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:31,410 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-16 16:47:31,412 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-16 16:47:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:31,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:47:31,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:31,500 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-16 16:47:31,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:31,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119901984] [2023-12-16 16:47:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119901984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:47:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139410827] [2023-12-16 16:47:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:31,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:47:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:47:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:47:31,504 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-16 16:47:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:31,546 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-12-16 16:47:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:47:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-16 16:47:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:31,549 INFO L225 Difference]: With dead ends: 29 [2023-12-16 16:47:31,549 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 16:47:31,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:47:31,551 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:31,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 16:47:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-12-16 16:47:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-16 16:47:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-12-16 16:47:31,556 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2023-12-16 16:47:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:31,556 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-12-16 16:47:31,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-16 16:47:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-12-16 16:47:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:47:31,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:31,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:31,567 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-16 16:47:31,762 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-16 16:47:31,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:31,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1066930555, now seen corresponding path program 1 times [2023-12-16 16:47:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773929958] [2023-12-16 16:47:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:31,765 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-16 16:47:31,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:31,766 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-16 16:47:31,771 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-16 16:47:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:31,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:47:31,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:32,017 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-16 16:47:32,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:32,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:32,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773929958] [2023-12-16 16:47:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773929958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:47:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916182160] [2023-12-16 16:47:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:32,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:47:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:47:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:47:32,027 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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-16 16:47:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:32,164 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2023-12-16 16:47:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:47:32,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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-16 16:47:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:32,165 INFO L225 Difference]: With dead ends: 30 [2023-12-16 16:47:32,165 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:47:32,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:47:32,167 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:32,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:47:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:47:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:47:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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-16 16:47:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-16 16:47:32,180 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2023-12-16 16:47:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:32,181 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-16 16:47:32,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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-16 16:47:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-16 16:47:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:47:32,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:32,182 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:32,185 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-16 16:47:32,382 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-16 16:47:32,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:32,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:32,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1531048614, now seen corresponding path program 1 times [2023-12-16 16:47:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318492090] [2023-12-16 16:47:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:32,384 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-16 16:47:32,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:32,385 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-16 16:47:32,388 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-16 16:47:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:32,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:47:32,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:32,458 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-16 16:47:32,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:47:32,515 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-16 16:47:32,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318492090] [2023-12-16 16:47:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318492090] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:47:32,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:47:32,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 16:47:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803558901] [2023-12-16 16:47:32,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:47:32,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:47:32,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:32,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:47:32,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:47:32,520 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-16 16:47:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:32,573 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-12-16 16:47:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:47:32,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 12 [2023-12-16 16:47:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:32,575 INFO L225 Difference]: With dead ends: 41 [2023-12-16 16:47:32,575 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 16:47:32,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:47:32,580 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:32,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 16:47:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 16:47:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-16 16:47:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-16 16:47:32,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 12 [2023-12-16 16:47:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:32,598 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-16 16:47:32,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-16 16:47:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-16 16:47:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:47:32,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:32,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:32,608 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-16 16:47:32,803 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-16 16:47:32,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:32,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -107828201, now seen corresponding path program 1 times [2023-12-16 16:47:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:32,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820121801] [2023-12-16 16:47:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:32,805 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-16 16:47:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:32,806 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-16 16:47:32,809 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-16 16:47:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:32,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:47:32,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:33,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:47:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:34,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820121801] [2023-12-16 16:47:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820121801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:47:34,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:47:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 16:47:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645289574] [2023-12-16 16:47:34,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:47:34,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:47:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:34,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:47:34,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:47:34,257 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 9 states have internal predecessors, (23), 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-16 16:47:38,808 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-16 16:47:42,837 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-16 16:47:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:43,509 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2023-12-16 16:47:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:47:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 9 states have internal predecessors, (23), 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 13 [2023-12-16 16:47:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:43,512 INFO L225 Difference]: With dead ends: 74 [2023-12-16 16:47:43,512 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 16:47:43,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:47:43,513 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:43,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 145 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2023-12-16 16:47:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 16:47:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2023-12-16 16:47:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 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-16 16:47:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2023-12-16 16:47:43,525 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 13 [2023-12-16 16:47:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:43,525 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2023-12-16 16:47:43,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 9 states have internal predecessors, (23), 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-16 16:47:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2023-12-16 16:47:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 16:47:43,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:43,527 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:43,537 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-16 16:47:43,729 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-16 16:47:43,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:43,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1991816474, now seen corresponding path program 2 times [2023-12-16 16:47:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686541165] [2023-12-16 16:47:43,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:47:43,731 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-16 16:47:43,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:43,732 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-16 16:47:43,734 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-16 16:47:43,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:47:43,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:47:43,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:47:43,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 16:47:43,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:43,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686541165] [2023-12-16 16:47:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686541165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:47:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49423200] [2023-12-16 16:47:43,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:43,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:47:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:43,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:47:43,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:47:43,872 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 3 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-16 16:47:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:44,009 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2023-12-16 16:47:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:47:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 3 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-16 16:47:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:44,011 INFO L225 Difference]: With dead ends: 73 [2023-12-16 16:47:44,011 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 16:47:44,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:47:44,012 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:44,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:47:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 16:47:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2023-12-16 16:47:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 58 states have internal predecessors, (70), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 16:47:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2023-12-16 16:47:44,030 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 18 [2023-12-16 16:47:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:44,031 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2023-12-16 16:47:44,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 3 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-16 16:47:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2023-12-16 16:47:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:47:44,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:44,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:44,040 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-16 16:47:44,238 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-16 16:47:44,238 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:44,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:44,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1010218476, now seen corresponding path program 1 times [2023-12-16 16:47:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:44,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047020811] [2023-12-16 16:47:44,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:44,240 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-16 16:47:44,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:44,241 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-16 16:47:44,242 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-16 16:47:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:44,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:47:44,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:44,305 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-16 16:47:44,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:47:44,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047020811] [2023-12-16 16:47:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047020811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:47:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:47:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:47:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456837109] [2023-12-16 16:47:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:47:44,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:47:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:47:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:47:44,310 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 16:47:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:44,347 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2023-12-16 16:47:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:47:44,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2023-12-16 16:47:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:44,348 INFO L225 Difference]: With dead ends: 100 [2023-12-16 16:47:44,348 INFO L226 Difference]: Without dead ends: 63 [2023-12-16 16:47:44,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-16 16:47:44,351 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:44,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-16 16:47:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-12-16 16:47:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.28) internal successors, (64), 52 states have internal predecessors, (64), 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-16 16:47:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-12-16 16:47:44,376 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 19 [2023-12-16 16:47:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:44,376 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-12-16 16:47:44,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 16:47:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-12-16 16:47:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:47:44,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:44,377 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:44,383 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-16 16:47:44,578 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-16 16:47:44,578 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:44,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash 713767865, now seen corresponding path program 1 times [2023-12-16 16:47:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95398204] [2023-12-16 16:47:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:47:44,579 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-16 16:47:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:44,580 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-16 16:47:44,581 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-16 16:47:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:47:44,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:47:44,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:47:44,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:47:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:47:44,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95398204] [2023-12-16 16:47:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95398204] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:47:44,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:47:44,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-16 16:47:44,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259784750] [2023-12-16 16:47:44,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:47:44,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:47:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:47:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:47:44,770 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:47:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:45,001 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2023-12-16 16:47:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 16:47:45,004 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-16 16:47:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:45,005 INFO L225 Difference]: With dead ends: 105 [2023-12-16 16:47:45,005 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 16:47:45,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:47:45,006 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:45,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 175 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:47:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 16:47:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-12-16 16:47:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 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-16 16:47:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-16 16:47:45,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 24 [2023-12-16 16:47:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:45,012 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-16 16:47:45,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:47:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-16 16:47:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 16:47:45,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:47:45,013 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:45,020 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-16 16:47:45,219 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-16 16:47:45,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:47:45,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:47:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 566378639, now seen corresponding path program 2 times [2023-12-16 16:47:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:47:45,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457972725] [2023-12-16 16:47:45,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:47:45,220 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-16 16:47:45,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:47:45,221 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-16 16:47:45,222 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-16 16:47:45,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:47:45,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:47:45,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:47:45,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:47:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 16:47:45,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:47:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 16:47:45,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:47:45,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457972725] [2023-12-16 16:47:45,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457972725] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:47:45,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:47:45,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-16 16:47:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406151554] [2023-12-16 16:47:45,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:47:45,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:47:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:47:45,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:47:45,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:47:45,377 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:47:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:47:45,414 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-12-16 16:47:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:47:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-12-16 16:47:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:47:45,415 INFO L225 Difference]: With dead ends: 46 [2023-12-16 16:47:45,415 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:47:45,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:47:45,416 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:47:45,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:47:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:47:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:47:45,417 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-16 16:47:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:47:45,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2023-12-16 16:47:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:47:45,417 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:47:45,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:47:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:47:45,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:47:45,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:47:45,426 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-16 16:47:45,620 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-16 16:47:45,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:47:45,894 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:47:45,894 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-16 16:47:45,894 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:47:45,894 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 47) no Hoare annotation was computed. [2023-12-16 16:47:45,894 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 47) the Hoare annotation is: (= (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-16 16:47:45,894 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 34 37) no Hoare annotation was computed. [2023-12-16 16:47:45,895 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))) (or (and (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse0 .cse1 (= ~counter~0 (_ bv0 32))) (and (= (_ bv2 32) ~counter~0) .cse0 .cse1) (and (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) .cse0 .cse1))) [2023-12-16 16:47:45,895 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2023-12-16 16:47:45,895 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 38 47) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))) (or (and (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (not (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32))) .cse0 .cse1) (and .cse0 .cse1 (not (bvslt ~counter~0 (_ bv2 32)))))) [2023-12-16 16:47:45,895 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (not (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32))) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) [2023-12-16 16:47:45,895 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2023-12-16 16:47:45,895 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-12-16 16:47:45,895 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2023-12-16 16:47:45,896 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2023-12-16 16:47:45,896 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 24) the Hoare annotation is: true [2023-12-16 16:47:45,896 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2023-12-16 16:47:45,896 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2023-12-16 16:47:45,896 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-12-16 16:47:45,898 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 16:47:45,900 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:47:45,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:47:45 BoogieIcfgContainer [2023-12-16 16:47:45,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:47:45,914 INFO L158 Benchmark]: Toolchain (without parser) took 15868.53ms. Allocated memory is still 299.9MB. Free memory was 243.7MB in the beginning and 118.4MB in the end (delta: 125.3MB). Peak memory consumption was 126.9MB. Max. memory is 8.0GB. [2023-12-16 16:47:45,914 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:47:45,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.67ms. Allocated memory is still 299.9MB. Free memory was 243.2MB in the beginning and 232.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:47:45,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.85ms. Allocated memory is still 299.9MB. Free memory was 232.2MB in the beginning and 230.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:47:45,915 INFO L158 Benchmark]: Boogie Preprocessor took 27.77ms. Allocated memory is still 299.9MB. Free memory was 230.6MB in the beginning and 228.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:47:45,915 INFO L158 Benchmark]: RCFGBuilder took 260.54ms. Allocated memory is still 299.9MB. Free memory was 228.5MB in the beginning and 216.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:47:45,916 INFO L158 Benchmark]: TraceAbstraction took 15301.78ms. Allocated memory is still 299.9MB. Free memory was 215.4MB in the beginning and 118.4MB in the end (delta: 97.0MB). Peak memory consumption was 98.6MB. Max. memory is 8.0GB. [2023-12-16 16:47:45,917 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.16ms. Allocated memory is still 197.1MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.67ms. Allocated memory is still 299.9MB. Free memory was 243.2MB in the beginning and 232.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.85ms. Allocated memory is still 299.9MB. Free memory was 232.2MB in the beginning and 230.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.77ms. Allocated memory is still 299.9MB. Free memory was 230.6MB in the beginning and 228.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 260.54ms. Allocated memory is still 299.9MB. Free memory was 228.5MB in the beginning and 216.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15301.78ms. Allocated memory is still 299.9MB. Free memory was 215.4MB in the beginning and 118.4MB in the end (delta: 97.0MB). Peak memory consumption was 98.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 15.2s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 547 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 163 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 32 PreInvPairs, 50 NumberOfFragments, 100 HoareAnnotationTreeSize, 32 FormulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FormulaSimplificationsInter, 130 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 161 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 778 SizeOfPredicates, 12 NumberOfNonLiveVariables, 373 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 175/213 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) && (counter == 1)) && (b == 1)) && !((r >= 1))) && (r == A)) && (q == 0)) || (((r == A) && (q == 0)) && !((counter < 2)))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((B == 1) && (b == 1)) && (r == A)) && (q == 0)) && (counter == 0)) || (((2 == counter) && (r == A)) && (q == 0))) || (((((r >= 1) && (counter == 1)) && (b == 2)) && (r == A)) && (q == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:47:45,949 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...