/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/hard2_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 03:36:52,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 03:36:52,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 03:36:52,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 03:36:52,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 03:36:52,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 03:36:52,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 03:36:52,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 03:36:52,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 03:36:52,717 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 03:36:52,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 03:36:52,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 03:36:52,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 03:36:52,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 03:36:52,719 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 03:36:52,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 03:36:52,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 03:36:52,720 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 03:36:52,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 03:36:52,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 03:36:52,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 03:36:52,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 03:36:52,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 03:36:52,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 03:36:52,722 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 03:36:52,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 03:36:52,722 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 03:36:52,722 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 03:36:52,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 03:36:52,722 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 03:36:52,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 03:36:52,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 03:36:52,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 03:36:52,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:36:52,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 03:36:52,724 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 03:36:52,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 03:36:52,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 03:36:52,725 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 03:36:52,725 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 03:36:52,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 03:36:52,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 03:36:52,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 03:36:52,922 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 03:36:52,922 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 03:36:52,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound10.c [2023-12-25 03:36:53,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 03:36:54,095 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 03:36:54,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_valuebound10.c [2023-12-25 03:36:54,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffba3f34a/728875ebe0324348926027e51b44ff21/FLAG1c744bcc6 [2023-12-25 03:36:54,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffba3f34a/728875ebe0324348926027e51b44ff21 [2023-12-25 03:36:54,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 03:36:54,118 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 03:36:54,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 03:36:54,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 03:36:54,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 03:36:54,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177d3269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54, skipping insertion in model container [2023-12-25 03:36:54,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,144 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 03:36:54,271 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/hard2_valuebound10.c[526,539] [2023-12-25 03:36:54,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:36:54,290 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 03:36:54,299 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/hard2_valuebound10.c[526,539] [2023-12-25 03:36:54,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 03:36:54,313 INFO L206 MainTranslator]: Completed translation [2023-12-25 03:36:54,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54 WrapperNode [2023-12-25 03:36:54,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 03:36:54,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 03:36:54,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 03:36:54,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 03:36:54,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,340 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2023-12-25 03:36:54,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 03:36:54,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 03:36:54,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 03:36:54,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 03:36:54,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,376 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-25 03:36:54,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 03:36:54,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 03:36:54,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 03:36:54,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 03:36:54,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (1/1) ... [2023-12-25 03:36:54,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 03:36:54,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 03:36:54,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 03:36:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 03:36:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 03:36:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 03:36:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 03:36:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 03:36:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 03:36:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 03:36:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 03:36:54,524 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 03:36:54,528 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 03:36:54,757 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 03:36:54,774 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 03:36:54,775 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 03:36:54,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:36:54 BoogieIcfgContainer [2023-12-25 03:36:54,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 03:36:54,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 03:36:54,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 03:36:54,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 03:36:54,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 03:36:54" (1/3) ... [2023-12-25 03:36:54,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618f346f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:36:54, skipping insertion in model container [2023-12-25 03:36:54,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 03:36:54" (2/3) ... [2023-12-25 03:36:54,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618f346f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 03:36:54, skipping insertion in model container [2023-12-25 03:36:54,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 03:36:54" (3/3) ... [2023-12-25 03:36:54,797 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound10.c [2023-12-25 03:36:54,809 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 03:36:54,810 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 03:36:54,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 03:36:54,843 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;@4aafcb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 03:36:54,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 03:36:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 03:36:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 03:36:54,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:54,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:54,852 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:54,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1830609328, now seen corresponding path program 1 times [2023-12-25 03:36:54,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:54,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356264807] [2023-12-25 03:36:54,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:54,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:54,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:54,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 03:36:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:54,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 03:36:54,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:36:54,985 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:54,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356264807] [2023-12-25 03:36:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356264807] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 03:36:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882938908] [2023-12-25 03:36:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:54,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 03:36:54,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 03:36:55,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:36:55,015 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:36:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:55,046 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2023-12-25 03:36:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 03:36:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2023-12-25 03:36:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:55,053 INFO L225 Difference]: With dead ends: 44 [2023-12-25 03:36:55,053 INFO L226 Difference]: Without dead ends: 21 [2023-12-25 03:36:55,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 03:36:55,057 INFO L413 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:55,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 03:36:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-25 03:36:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-25 03:36:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:36:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2023-12-25 03:36:55,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2023-12-25 03:36:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:55,083 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2023-12-25 03:36:55,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:36:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2023-12-25 03:36:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 03:36:55,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:55,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:55,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 03:36:55,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:55,286 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:55,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash -55601966, now seen corresponding path program 1 times [2023-12-25 03:36:55,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:55,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47402450] [2023-12-25 03:36:55,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:55,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:55,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:55,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:55,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 03:36:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:55,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:36:55,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:36:55,352 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:55,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47402450] [2023-12-25 03:36:55,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47402450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:55,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:55,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:36:55,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696359934] [2023-12-25 03:36:55,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:55,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:36:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:36:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:36:55,354 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:36:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:55,460 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2023-12-25 03:36:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:36:55,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2023-12-25 03:36:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:55,462 INFO L225 Difference]: With dead ends: 34 [2023-12-25 03:36:55,462 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 03:36:55,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-25 03:36:55,463 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:55,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:36:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 03:36:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2023-12-25 03:36:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:36:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-25 03:36:55,469 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 8 [2023-12-25 03:36:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:55,470 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-25 03:36:55,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:36:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-25 03:36:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-25 03:36:55,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:55,470 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:55,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:55,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:55,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:55,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1587104181, now seen corresponding path program 1 times [2023-12-25 03:36:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:55,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130751974] [2023-12-25 03:36:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:55,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:55,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:55,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 03:36:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:55,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 03:36:55,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 03:36:55,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:55,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130751974] [2023-12-25 03:36:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130751974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:55,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:55,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:36:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685383380] [2023-12-25 03:36:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:55,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:36:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:36:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:36:55,740 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 03:36:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:55,836 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-25 03:36:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:36:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 13 [2023-12-25 03:36:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:55,837 INFO L225 Difference]: With dead ends: 38 [2023-12-25 03:36:55,837 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 03:36:55,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-25 03:36:55,839 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:55,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:36:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 03:36:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2023-12-25 03:36:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 03:36:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-25 03:36:55,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 13 [2023-12-25 03:36:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:55,844 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-25 03:36:55,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 03:36:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-25 03:36:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 03:36:55,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:55,845 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:55,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:56,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:56,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:56,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1972613170, now seen corresponding path program 1 times [2023-12-25 03:36:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315506704] [2023-12-25 03:36:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:56,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:56,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 03:36:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:56,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 03:36:56,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 03:36:56,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:56,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315506704] [2023-12-25 03:36:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315506704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:56,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 03:36:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611272882] [2023-12-25 03:36:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:56,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 03:36:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:56,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 03:36:56,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 03:36:56,195 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:36:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:56,360 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2023-12-25 03:36:56,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 03:36:56,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 03:36:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:56,361 INFO L225 Difference]: With dead ends: 57 [2023-12-25 03:36:56,361 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 03:36:56,362 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-25 03:36:56,362 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:56,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 03:36:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 03:36:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-25 03:36:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:36:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2023-12-25 03:36:56,370 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 18 [2023-12-25 03:36:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:56,370 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2023-12-25 03:36:56,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 03:36:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2023-12-25 03:36:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 03:36:56,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:56,371 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:56,375 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 (5)] Ended with exit code 0 [2023-12-25 03:36:56,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:56,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:56,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1810344840, now seen corresponding path program 1 times [2023-12-25 03:36:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:56,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960250964] [2023-12-25 03:36:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:56,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:56,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:56,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:56,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 03:36:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:56,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 03:36:56,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 03:36:56,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:36:56,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:56,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960250964] [2023-12-25 03:36:56,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960250964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:36:56,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:36:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 03:36:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378128471] [2023-12-25 03:36:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:56,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 03:36:56,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 03:36:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-25 03:36:56,870 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:36:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:57,131 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-12-25 03:36:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 03:36:57,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-25 03:36:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:57,132 INFO L225 Difference]: With dead ends: 57 [2023-12-25 03:36:57,132 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 03:36:57,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:36:57,133 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:57,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 03:36:57,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 03:36:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-25 03:36:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 03:36:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-12-25 03:36:57,139 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 25 [2023-12-25 03:36:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:57,139 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-12-25 03:36:57,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 03:36:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-12-25 03:36:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 03:36:57,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:57,140 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:57,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:57,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:57,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:57,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -447891575, now seen corresponding path program 1 times [2023-12-25 03:36:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567606821] [2023-12-25 03:36:57,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:57,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:57,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:57,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:57,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 03:36:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:57,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 03:36:57,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:36:57,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:36:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 03:36:57,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:36:57,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567606821] [2023-12-25 03:36:57,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567606821] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 03:36:57,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 03:36:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-25 03:36:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131848257] [2023-12-25 03:36:57,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:36:57,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 03:36:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:36:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 03:36:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-25 03:36:57,977 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:36:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:36:58,347 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-12-25 03:36:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 03:36:58,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-25 03:36:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:36:58,348 INFO L225 Difference]: With dead ends: 58 [2023-12-25 03:36:58,348 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 03:36:58,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:36:58,349 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 03:36:58,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 03:36:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 03:36:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2023-12-25 03:36:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 03:36:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-12-25 03:36:58,357 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 35 [2023-12-25 03:36:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:36:58,357 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-12-25 03:36:58,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 03:36:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-12-25 03:36:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 03:36:58,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:36:58,358 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:36:58,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 03:36:58,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:58,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:36:58,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:36:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1423879489, now seen corresponding path program 1 times [2023-12-25 03:36:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:36:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704360492] [2023-12-25 03:36:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:36:58,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:36:58,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:36:58,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:36:58,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 03:36:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:36:58,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 03:36:58,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:36:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 03:36:58,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:37:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 03:37:00,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:37:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704360492] [2023-12-25 03:37:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704360492] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:37:00,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:37:00,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 03:37:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905262642] [2023-12-25 03:37:00,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:37:00,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 03:37:00,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:37:00,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 03:37:00,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:37:00,313 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-25 03:37:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:37:01,866 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2023-12-25 03:37:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 03:37:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 42 [2023-12-25 03:37:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:37:01,872 INFO L225 Difference]: With dead ends: 103 [2023-12-25 03:37:01,872 INFO L226 Difference]: Without dead ends: 90 [2023-12-25 03:37:01,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2023-12-25 03:37:01,873 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 03:37:01,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 159 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 03:37:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-25 03:37:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2023-12-25 03:37:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.16) internal successors, (58), 53 states have internal predecessors, (58), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 03:37:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2023-12-25 03:37:01,884 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 42 [2023-12-25 03:37:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:37:01,885 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2023-12-25 03:37:01,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-25 03:37:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2023-12-25 03:37:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-25 03:37:01,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:37:01,886 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:37:01,893 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 (8)] Ended with exit code 0 [2023-12-25 03:37:02,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:37:02,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:37:02,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:37:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1460518785, now seen corresponding path program 1 times [2023-12-25 03:37:02,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:37:02,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840456971] [2023-12-25 03:37:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:37:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:37:02,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:37:02,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:37:02,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 03:37:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:37:02,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 03:37:02,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:37:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:37:02,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:37:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 03:37:12,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:37:12,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840456971] [2023-12-25 03:37:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840456971] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:37:12,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:37:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-25 03:37:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428368890] [2023-12-25 03:37:12,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:37:12,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 03:37:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:37:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 03:37:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-12-25 03:37:12,063 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 03:37:23,899 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:37:28,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:32,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:37,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:46,137 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 39 DAG size of output: 19 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:37:47,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:52,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:56,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:37:58,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:03,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:07,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:18,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:21,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:23,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:28,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:39,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:38:41,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:01,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:39:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:39:06,090 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2023-12-25 03:39:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 03:39:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 55 [2023-12-25 03:39:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:39:06,110 INFO L225 Difference]: With dead ends: 164 [2023-12-25 03:39:06,110 INFO L226 Difference]: Without dead ends: 152 [2023-12-25 03:39:06,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2023-12-25 03:39:06,111 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 92 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 110 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:39:06,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 177 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 284 Invalid, 10 Unknown, 0 Unchecked, 70.1s Time] [2023-12-25 03:39:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-25 03:39:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2023-12-25 03:39:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 78 states have internal predecessors, (91), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-25 03:39:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2023-12-25 03:39:06,140 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 55 [2023-12-25 03:39:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:39:06,140 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2023-12-25 03:39:06,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-25 03:39:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2023-12-25 03:39:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-25 03:39:06,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:39:06,142 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:39:06,146 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 (9)] Ended with exit code 0 [2023-12-25 03:39:06,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:06,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:39:06,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:39:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash -814878683, now seen corresponding path program 1 times [2023-12-25 03:39:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:39:06,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179924911] [2023-12-25 03:39:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:39:06,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:06,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:39:06,347 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:39:06,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 03:39:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:39:06,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 03:39:06,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:39:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 03:39:07,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:39:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-25 03:39:18,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:39:18,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179924911] [2023-12-25 03:39:18,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179924911] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:39:18,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:39:18,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-25 03:39:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242521843] [2023-12-25 03:39:18,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:39:18,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 03:39:18,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:39:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 03:39:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-12-25 03:39:18,330 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 8 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-25 03:39:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:39:34,873 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2023-12-25 03:39:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 03:39:34,895 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 8 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 66 [2023-12-25 03:39:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:39:34,896 INFO L225 Difference]: With dead ends: 176 [2023-12-25 03:39:34,896 INFO L226 Difference]: Without dead ends: 141 [2023-12-25 03:39:34,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2023-12-25 03:39:34,897 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-12-25 03:39:34,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 216 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-12-25 03:39:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-25 03:39:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2023-12-25 03:39:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 81 states have internal predecessors, (91), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-25 03:39:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2023-12-25 03:39:34,932 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 66 [2023-12-25 03:39:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:39:34,933 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2023-12-25 03:39:34,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 16 states have internal predecessors, (32), 8 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-25 03:39:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2023-12-25 03:39:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-25 03:39:34,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:39:34,938 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:39:34,945 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 (10)] Ended with exit code 0 [2023-12-25 03:39:35,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:35,146 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:39:35,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:39:35,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1399001704, now seen corresponding path program 1 times [2023-12-25 03:39:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:39:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23713383] [2023-12-25 03:39:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:39:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:35,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:39:35,148 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:39:35,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 03:39:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:39:35,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 03:39:35,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:39:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 03:39:35,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:39:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 03:39:36,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:39:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23713383] [2023-12-25 03:39:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23713383] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:39:36,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:39:36,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2023-12-25 03:39:36,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330796254] [2023-12-25 03:39:36,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:39:36,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 03:39:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:39:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 03:39:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-25 03:39:36,712 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 03:39:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:39:37,537 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2023-12-25 03:39:37,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 03:39:37,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 71 [2023-12-25 03:39:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:39:37,557 INFO L225 Difference]: With dead ends: 136 [2023-12-25 03:39:37,558 INFO L226 Difference]: Without dead ends: 115 [2023-12-25 03:39:37,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-25 03:39:37,558 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 03:39:37,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 261 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 03:39:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-25 03:39:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-25 03:39:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 73 states have internal predecessors, (82), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-25 03:39:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2023-12-25 03:39:37,591 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 71 [2023-12-25 03:39:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:39:37,591 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2023-12-25 03:39:37,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-12-25 03:39:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2023-12-25 03:39:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 03:39:37,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:39:37,592 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:39:37,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 03:39:37,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:37,793 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:39:37,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:39:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1539229007, now seen corresponding path program 1 times [2023-12-25 03:39:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:39:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751321159] [2023-12-25 03:39:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:39:37,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:37,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:39:37,798 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:39:37,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 03:39:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:39:37,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 03:39:37,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:39:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-12-25 03:39:37,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 03:39:37,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:39:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751321159] [2023-12-25 03:39:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751321159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 03:39:37,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 03:39:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 03:39:37,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009155789] [2023-12-25 03:39:37,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 03:39:37,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 03:39:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:39:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 03:39:37,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:39:37,923 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 03:39:42,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 03:39:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:39:42,075 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2023-12-25 03:39:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 03:39:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2023-12-25 03:39:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:39:42,077 INFO L225 Difference]: With dead ends: 124 [2023-12-25 03:39:42,077 INFO L226 Difference]: Without dead ends: 111 [2023-12-25 03:39:42,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 03:39:42,078 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 03:39:42,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 03:39:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-25 03:39:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2023-12-25 03:39:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 67 states have internal predecessors, (76), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-25 03:39:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2023-12-25 03:39:42,100 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 75 [2023-12-25 03:39:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:39:42,101 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2023-12-25 03:39:42,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 03:39:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2023-12-25 03:39:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-25 03:39:42,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:39:42,103 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:39:42,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 03:39:42,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:42,307 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:39:42,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:39:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash 488800405, now seen corresponding path program 2 times [2023-12-25 03:39:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:39:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013913660] [2023-12-25 03:39:42,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:39:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:39:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:39:42,310 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:39:42,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 03:39:42,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:39:42,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:39:42,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 03:39:42,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:39:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 03:39:42,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:39:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-25 03:39:48,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:39:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013913660] [2023-12-25 03:39:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013913660] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:39:48,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:39:48,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-12-25 03:39:48,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379302074] [2023-12-25 03:39:48,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:39:48,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 03:39:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:39:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 03:39:48,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-25 03:39:48,468 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-25 03:39:56,658 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:40:01,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:12,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:17,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:21,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:25,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:30,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:34,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:38,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:42,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:47,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:51,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:55,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:40:57,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:01,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:05,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:09,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:14,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:18,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:22,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:27,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:41:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:41:27,951 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2023-12-25 03:41:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 03:41:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 77 [2023-12-25 03:41:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:41:27,965 INFO L225 Difference]: With dead ends: 212 [2023-12-25 03:41:27,965 INFO L226 Difference]: Without dead ends: 180 [2023-12-25 03:41:27,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2023-12-25 03:41:27,966 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 34 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.9s IncrementalHoareTripleChecker+Time [2023-12-25 03:41:27,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 271 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 229 Invalid, 19 Unknown, 0 Unchecked, 84.9s Time] [2023-12-25 03:41:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-25 03:41:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2023-12-25 03:41:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 97 states have (on average 1.175257731958763) internal successors, (114), 105 states have internal predecessors, (114), 54 states have call successors, (54), 15 states have call predecessors, (54), 15 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-25 03:41:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 220 transitions. [2023-12-25 03:41:28,017 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 220 transitions. Word has length 77 [2023-12-25 03:41:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:41:28,017 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 220 transitions. [2023-12-25 03:41:28,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-25 03:41:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 220 transitions. [2023-12-25 03:41:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-25 03:41:28,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:41:28,018 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:41:28,023 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 (13)] Ended with exit code 0 [2023-12-25 03:41:28,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:41:28,222 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:41:28,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:41:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2065528550, now seen corresponding path program 1 times [2023-12-25 03:41:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:41:28,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876427311] [2023-12-25 03:41:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 03:41:28,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:41:28,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:41:28,234 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:41:28,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 03:41:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 03:41:28,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 03:41:28,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:41:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-12-25 03:41:28,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:41:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-12-25 03:41:31,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:41:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876427311] [2023-12-25 03:41:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876427311] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:41:31,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:41:31,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 03:41:31,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746640801] [2023-12-25 03:41:31,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:41:31,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 03:41:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:41:31,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 03:41:31,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-12-25 03:41:31,861 INFO L87 Difference]: Start difference. First operand 167 states and 220 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 9 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-25 03:41:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:41:39,526 INFO L93 Difference]: Finished difference Result 205 states and 271 transitions. [2023-12-25 03:41:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 03:41:39,527 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 9 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 85 [2023-12-25 03:41:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:41:39,528 INFO L225 Difference]: With dead ends: 205 [2023-12-25 03:41:39,528 INFO L226 Difference]: Without dead ends: 157 [2023-12-25 03:41:39,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2023-12-25 03:41:39,529 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 65 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:41:39,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 295 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-25 03:41:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-25 03:41:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2023-12-25 03:41:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 93 states have internal predecessors, (101), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-25 03:41:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2023-12-25 03:41:39,580 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 85 [2023-12-25 03:41:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:41:39,581 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2023-12-25 03:41:39,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 9 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-25 03:41:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2023-12-25 03:41:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-25 03:41:39,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:41:39,582 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 03:41:39,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 03:41:39,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:41:39,786 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:41:39,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:41:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash -376584808, now seen corresponding path program 3 times [2023-12-25 03:41:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:41:39,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203290565] [2023-12-25 03:41:39,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:41:39,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:41:39,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:41:39,788 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:41:39,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 03:41:39,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:41:39,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:41:39,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 03:41:39,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:41:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 90 proven. 26 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-12-25 03:41:42,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:42:14,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:42:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203290565] [2023-12-25 03:42:14,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203290565] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 03:42:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1618322963] [2023-12-25 03:42:14,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 03:42:14,442 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 03:42:14,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 03:42:14,481 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 03:42:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-25 03:42:14,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 03:42:14,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:42:14,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 03:42:14,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:42:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 58 proven. 28 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-25 03:42:16,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:43:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 58 proven. 28 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-25 03:43:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1618322963] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:43:50,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 03:43:50,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 13] total 30 [2023-12-25 03:43:50,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098269893] [2023-12-25 03:43:50,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 03:43:50,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-25 03:43:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:43:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-25 03:43:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=903, Unknown=3, NotChecked=0, Total=1122 [2023-12-25 03:43:50,514 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 15 states have call successors, (40), 3 states have call predecessors, (40), 2 states have return successors, (39), 11 states have call predecessors, (39), 13 states have call successors, (39) [2023-12-25 03:44:40,464 WARN L293 SmtUtils]: Spent 27.51s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:44:47,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:27,130 WARN L293 SmtUtils]: Spent 25.53s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:45:30,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:35,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:39,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:44,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:45:48,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:46:04,640 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:47:09,006 WARN L293 SmtUtils]: Spent 55.85s on a formula simplification. DAG size of input: 89 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:47:18,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:22,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:23,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:48,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:47:50,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:05,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:07,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:12,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:20,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:21,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:40,995 WARN L293 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:48:43,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:48:47,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:00,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:29,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:36,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:38,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:42,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:49:46,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:03,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:06,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:09,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:22,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:23,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:27,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:33,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:38,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:45,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:50:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:50:45,636 INFO L93 Difference]: Finished difference Result 188 states and 237 transitions. [2023-12-25 03:50:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 03:50:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 15 states have call successors, (40), 3 states have call predecessors, (40), 2 states have return successors, (39), 11 states have call predecessors, (39), 13 states have call successors, (39) Word has length 85 [2023-12-25 03:50:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:50:45,648 INFO L225 Difference]: With dead ends: 188 [2023-12-25 03:50:45,648 INFO L226 Difference]: Without dead ends: 181 [2023-12-25 03:50:45,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 361.7s TimeCoverageRelationStatistics Valid=539, Invalid=2212, Unknown=5, NotChecked=0, Total=2756 [2023-12-25 03:50:45,649 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 114 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 155 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 136.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 141.2s IncrementalHoareTripleChecker+Time [2023-12-25 03:50:45,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 434 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 556 Invalid, 16 Unknown, 0 Unchecked, 141.2s Time] [2023-12-25 03:50:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-25 03:50:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2023-12-25 03:50:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 110 states have internal predecessors, (123), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-25 03:50:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2023-12-25 03:50:45,687 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 85 [2023-12-25 03:50:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:50:45,687 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2023-12-25 03:50:45,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 28 states have internal predecessors, (56), 15 states have call successors, (40), 3 states have call predecessors, (40), 2 states have return successors, (39), 11 states have call predecessors, (39), 13 states have call successors, (39) [2023-12-25 03:50:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2023-12-25 03:50:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 03:50:45,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 03:50:45,688 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:50:45,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-12-25 03:50:45,895 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 (15)] Ended with exit code 0 [2023-12-25 03:50:46,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:50:46,092 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 03:50:46,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 03:50:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1154059924, now seen corresponding path program 2 times [2023-12-25 03:50:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 03:50:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285708781] [2023-12-25 03:50:46,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 03:50:46,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:50:46,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 03:50:46,094 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 03:50:46,096 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 (17)] Waiting until timeout for monitored process [2023-12-25 03:50:46,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 03:50:46,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 03:50:46,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 03:50:46,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 03:50:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 62 proven. 38 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-25 03:50:49,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 03:51:40,373 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 03:51:40,396 WARN L340 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 (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 03:51:41,205 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:51:41,217 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 03:51:41,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 03:51:41,406 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 97 with TraceHistMax 16,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. [2023-12-25 03:51:41,410 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 03:51:41,411 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:51:41,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:51:41 BoogieIcfgContainer [2023-12-25 03:51:41,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:51:41,413 INFO L158 Benchmark]: Toolchain (without parser) took 887294.85ms. Allocated memory was 272.6MB in the beginning and 327.2MB in the end (delta: 54.5MB). Free memory was 221.7MB in the beginning and 200.6MB in the end (delta: 21.1MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2023-12-25 03:51:41,413 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:51:41,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.04ms. Allocated memory is still 272.6MB. Free memory was 221.7MB in the beginning and 210.0MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:51:41,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.27ms. Allocated memory is still 272.6MB. Free memory was 210.0MB in the beginning and 208.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:51:41,414 INFO L158 Benchmark]: Boogie Preprocessor took 48.68ms. Allocated memory is still 272.6MB. Free memory was 208.5MB in the beginning and 206.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:51:41,414 INFO L158 Benchmark]: RCFGBuilder took 385.66ms. Allocated memory is still 272.6MB. Free memory was 206.5MB in the beginning and 192.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 03:51:41,414 INFO L158 Benchmark]: TraceAbstraction took 886635.76ms. Allocated memory was 272.6MB in the beginning and 327.2MB in the end (delta: 54.5MB). Free memory was 192.3MB in the beginning and 200.6MB in the end (delta: -8.3MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2023-12-25 03:51:41,415 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.11ms. Allocated memory is still 177.2MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.04ms. Allocated memory is still 272.6MB. Free memory was 221.7MB in the beginning and 210.0MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.27ms. Allocated memory is still 272.6MB. Free memory was 210.0MB in the beginning and 208.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.68ms. Allocated memory is still 272.6MB. Free memory was 208.5MB in the beginning and 206.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 385.66ms. Allocated memory is still 272.6MB. Free memory was 206.5MB in the beginning and 192.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 886635.76ms. Allocated memory was 272.6MB in the beginning and 327.2MB in the end (delta: 54.5MB). Free memory was 192.3MB in the beginning and 200.6MB in the end (delta: -8.3MB). Peak memory consumption was 47.2MB. 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 - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 97 with TraceHistMax 16,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 886.6s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 660.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 312.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 2310 SdHoareTripleChecker+Invalid, 303.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1907 mSDsCounter, 478 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1993 IncrementalHoareTripleChecker+Invalid, 2517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 478 mSolverCounterUnsat, 403 mSDtfsCounter, 1993 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1330 GetRequests, 1129 SyntacticMatches, 3 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 454.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=14, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 98 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 166.1s InterpolantComputationTime, 748 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1241 ConstructedInterpolants, 9 QuantifiedInterpolants, 7378 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1365 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 3993/4205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown