/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/bresenham-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:41:55,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:41:55,756 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 00:41:55,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:41:55,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:41:55,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:41:55,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:41:55,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:41:55,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:41:55,786 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:41:55,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:41:55,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:41:55,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:41:55,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:41:55,788 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:41:55,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:41:55,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:41:55,789 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:41:55,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:41:55,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:41:55,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:41:55,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:41:55,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:41:55,791 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:41:55,791 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:41:55,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:41:55,792 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:41:55,792 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:41:55,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:41:55,792 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:41:55,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:41:55,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:41:55,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:41:55,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:41:55,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:41:55,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:41:55,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:41:55,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:41:55,794 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:41:55,794 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:41:55,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:41:55,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:41:55,794 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:41:55,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:41:55,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:41:55,795 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:41:55,795 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 00:41:55,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:41:56,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:41:56,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:41:56,020 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:41:56,020 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:41:56,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound5.c [2023-12-25 00:41:57,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:41:57,254 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:41:57,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound5.c [2023-12-25 00:41:57,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2185c5e/ba9d2fe8e1f74e4bbd3433963f2e5f78/FLAGdf1920203 [2023-12-25 00:41:57,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2185c5e/ba9d2fe8e1f74e4bbd3433963f2e5f78 [2023-12-25 00:41:57,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:41:57,272 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:41:57,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:41:57,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:41:57,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:41:57,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30da391c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57, skipping insertion in model container [2023-12-25 00:41:57,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,293 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:41:57,391 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/bresenham-ll_unwindbound5.c[597,610] [2023-12-25 00:41:57,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:41:57,413 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:41:57,421 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/bresenham-ll_unwindbound5.c[597,610] [2023-12-25 00:41:57,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:41:57,437 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:41:57,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57 WrapperNode [2023-12-25 00:41:57,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:41:57,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:41:57,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:41:57,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:41:57,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,465 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-12-25 00:41:57,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:41:57,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:41:57,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:41:57,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:41:57,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,489 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 00:41:57,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:41:57,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:41:57,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:41:57,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:41:57,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (1/1) ... [2023-12-25 00:41:57,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:41:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:41:57,540 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 00:41:57,560 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 00:41:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:41:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:41:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:41:57,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:41:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:41:57,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:41:57,648 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:41:57,649 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:41:58,136 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:41:58,157 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:41:58,157 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:41:58,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:41:58 BoogieIcfgContainer [2023-12-25 00:41:58,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:41:58,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:41:58,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:41:58,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:41:58,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:41:57" (1/3) ... [2023-12-25 00:41:58,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cc72d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:41:58, skipping insertion in model container [2023-12-25 00:41:58,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:41:57" (2/3) ... [2023-12-25 00:41:58,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cc72d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:41:58, skipping insertion in model container [2023-12-25 00:41:58,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:41:58" (3/3) ... [2023-12-25 00:41:58,163 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound5.c [2023-12-25 00:41:58,175 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:41:58,175 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:41:58,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:41:58,209 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;@3347588c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:41:58,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:41:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:41:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 00:41:58,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:41:58,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:41:58,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:41:58,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:41:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-12-25 00:41:58,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:41:58,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601000114] [2023-12-25 00:41:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:41:58,231 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 00:41:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:41:58,233 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 00:41:58,263 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 00:41:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:41:58,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:41:58,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:41:58,765 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 00:41:58,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:41:58,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:41:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601000114] [2023-12-25 00:41:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601000114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:41:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:41:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 00:41:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581207705] [2023-12-25 00:41:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:41:58,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 00:41:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:41:58,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 00:41:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 00:41:58,797 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:42:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:42:00,010 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-25 00:42:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:42:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 00:42:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:42:00,017 INFO L225 Difference]: With dead ends: 46 [2023-12-25 00:42:00,017 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 00:42:00,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 00:42:00,024 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:42:00,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 00:42:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 00:42:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-12-25 00:42:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-25 00:42:00,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-12-25 00:42:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:42:00,058 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-25 00:42:00,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:42:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-25 00:42:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:42:00,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:42:00,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:42:00,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 00:42:00,265 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 00:42:00,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:42:00,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:42:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-12-25 00:42:00,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:42:00,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424888838] [2023-12-25 00:42:00,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:42:00,269 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 00:42:00,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:42:00,271 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 00:42:00,272 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 00:42:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:42:03,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:42:03,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:42:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:42:04,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:42:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:42:39,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:42:39,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424888838] [2023-12-25 00:42:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424888838] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:42:39,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:42:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-12-25 00:42:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297320209] [2023-12-25 00:42:39,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:42:39,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 00:42:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:42:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 00:42:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2023-12-25 00:42:39,418 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:47,689 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 00:42:49,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:43:17,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 00:43:23,159 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 00:43:27,728 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 00:43:39,045 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 00:43:43,127 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 00:43:47,140 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 00:43:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:43:47,141 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-12-25 00:43:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:43:47,172 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 00:43:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:43:47,173 INFO L225 Difference]: With dead ends: 52 [2023-12-25 00:43:47,173 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 00:43:47,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2023-12-25 00:43:47,176 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:43:47,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 79 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 40.9s Time] [2023-12-25 00:43:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 00:43:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2023-12-25 00:43:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:43:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-12-25 00:43:47,184 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 17 [2023-12-25 00:43:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:43:47,185 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-12-25 00:43:47,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:43:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-12-25 00:43:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 00:43:47,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:43:47,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:43:47,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 00:43:47,395 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 00:43:47,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:43:47,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:43:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1288678065, now seen corresponding path program 1 times [2023-12-25 00:43:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:43:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708750953] [2023-12-25 00:43:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:43:47,397 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 00:43:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:43:47,399 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 00:43:47,402 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 00:44:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:44:20,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 00:44:20,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:44:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:44:22,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:45:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:45:24,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:45:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708750953] [2023-12-25 00:45:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708750953] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:45:24,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:45:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-12-25 00:45:24,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819704203] [2023-12-25 00:45:24,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:45:24,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 00:45:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:45:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 00:45:24,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=311, Unknown=6, NotChecked=0, Total=380 [2023-12-25 00:45:24,615 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:45:50,011 WARN L293 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 42 DAG size of output: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:45:55,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:45:58,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:46:02,869 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 00:46:06,876 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 00:46:11,410 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 00:46:29,048 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 00:46:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:46:29,589 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2023-12-25 00:46:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:46:29,622 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-25 00:46:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:46:29,623 INFO L225 Difference]: With dead ends: 64 [2023-12-25 00:46:29,623 INFO L226 Difference]: Without dead ends: 60 [2023-12-25 00:46:29,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=143, Invalid=721, Unknown=6, NotChecked=0, Total=870 [2023-12-25 00:46:29,624 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.6s IncrementalHoareTripleChecker+Time [2023-12-25 00:46:29,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 99 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 34.6s Time] [2023-12-25 00:46:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-25 00:46:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2023-12-25 00:46:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 00:46:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-12-25 00:46:29,649 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2023-12-25 00:46:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:46:29,649 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-12-25 00:46:29,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:46:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-12-25 00:46:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 00:46:29,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:46:29,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:46:29,691 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 00:46:29,850 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 00:46:29,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:46:29,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:46:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-12-25 00:46:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:46:29,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009940561] [2023-12-25 00:46:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:46:29,851 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 00:46:29,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:46:29,856 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 00:46:29,857 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 00:46:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:46:30,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 00:46:30,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:46:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:46:30,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:46:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:46:30,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:46:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009940561] [2023-12-25 00:46:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009940561] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:46:30,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:46:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 00:46:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485895196] [2023-12-25 00:46:30,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:46:30,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 00:46:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:46:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 00:46:30,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 00:46:30,160 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:46:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:46:31,082 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-12-25 00:46:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 00:46:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 00:46:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:46:31,083 INFO L225 Difference]: With dead ends: 76 [2023-12-25 00:46:31,083 INFO L226 Difference]: Without dead ends: 70 [2023-12-25 00:46:31,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:46:31,084 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:46:31,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 93 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 00:46:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-25 00:46:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2023-12-25 00:46:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 00:46:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2023-12-25 00:46:31,094 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2023-12-25 00:46:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:46:31,095 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2023-12-25 00:46:31,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:46:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2023-12-25 00:46:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 00:46:31,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:46:31,095 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:46:31,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 00:46:31,303 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 00:46:31,304 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:46:31,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:46:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-12-25 00:46:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:46:31,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142454227] [2023-12-25 00:46:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:46:31,305 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 00:46:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:46:31,324 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 00:46:31,339 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 00:46:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:46:33,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 00:46:33,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:46:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 00:46:49,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:48:28,652 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:48:37,517 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse2 (bvneg .cse1)) (.cse7 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv1 64))) (.cse0 (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse4 (bvmul .cse7 (_ bv4 64))) (.cse5 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse7))) (.cse6 (bvneg (bvadd (bvmul (_ bv2 64) .cse7) |c_ULTIMATE.start_main_~v~0#1| (bvmul .cse2 (_ bv2 64)))))) (or (bvsle .cse0 .cse1) (not (= (_ bv0 64) (bvadd .cse2 (bvneg (bvmul (_ bv2 64) (bvmul .cse1 .cse3))) .cse4 .cse5 .cse6))) (= (_ bv0 64) (bvadd (bvneg (bvmul (bvmul .cse3 .cse0) (_ bv2 64))) .cse2 (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse4 .cse5 .cse6)) (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)) (not (bvsle |c_ULTIMATE.start_main_~x~0#1| .cse1)))))) is different from true [2023-12-25 00:48:58,972 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:49:25,098 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:49:50,919 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:49:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-12-25 00:49:55,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:55,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142454227] [2023-12-25 00:49:55,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142454227] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:49:55,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:49:55,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2023-12-25 00:49:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685721775] [2023-12-25 00:49:55,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:49:55,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 00:49:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 00:49:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=4, NotChecked=42, Total=552 [2023-12-25 00:49:55,201 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 24 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:50:32,650 WARN L293 SmtUtils]: Spent 21.65s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:50:37,143 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 00:50:38,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:50:42,991 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 00:50:47,014 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 00:51:07,229 WARN L293 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:51:11,441 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 00:51:15,841 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 00:51:19,843 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 00:51:23,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 00:51:35,544 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:51:39,555 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 00:51:43,591 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 00:51:50,867 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 00:51:55,662 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 00:52:04,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:11,550 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 00:52:15,588 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 00:52:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:52:31,829 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2023-12-25 00:52:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 00:52:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-12-25 00:52:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:52:31,833 INFO L225 Difference]: With dead ends: 72 [2023-12-25 00:52:31,833 INFO L226 Difference]: Without dead ends: 64 [2023-12-25 00:52:31,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 159.2s TimeCoverageRelationStatistics Valid=209, Invalid=912, Unknown=5, NotChecked=64, Total=1190 [2023-12-25 00:52:31,834 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 26 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 78.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:52:31,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 98 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 265 Invalid, 13 Unknown, 44 Unchecked, 78.2s Time] [2023-12-25 00:52:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-25 00:52:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-25 00:52:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:52:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-12-25 00:52:31,847 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 24 [2023-12-25 00:52:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:52:31,847 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-12-25 00:52:31,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 00:52:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-12-25 00:52:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 00:52:31,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:52:31,848 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 00:52:31,864 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 (6)] Ended with exit code 0 [2023-12-25 00:52:32,063 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 00:52:32,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:52:32,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:52:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash 506464861, now seen corresponding path program 1 times [2023-12-25 00:52:32,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:52:32,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125869160] [2023-12-25 00:52:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:52:32,065 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 00:52:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:52:32,066 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 00:52:32,067 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 00:52:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:52:35,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 00:52:35,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:52:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:52:43,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:53:46,482 WARN L293 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:54:35,395 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:54:45,391 WARN L293 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:54:53,895 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse2 (bvneg .cse1)) (.cse3 (bvmul .cse6 (_ bv4 64))) (.cse4 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse6))) (.cse5 (bvneg (bvadd (bvmul (_ bv2 64) .cse6) |c_ULTIMATE.start_main_~v~0#1|)))) (or (bvsle .cse0 .cse1) (= (_ bv0 64) (bvadd .cse2 (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse3 .cse4 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse0) (_ bv2 64))) .cse5)) (not (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64))) (not (= (bvadd .cse2 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse3 .cse4 .cse5) (_ bv0 64))) (not (bvsle |c_ULTIMATE.start_main_~x~0#1| .cse1))))) is different from true [2023-12-25 00:55:06,910 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:55:32,789 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:55:59,200 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:56:25,183 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:56:39,378 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:56:43,845 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse0 (bvneg .cse1)) (.cse5 (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse6))) (.cse3 (bvneg (bvadd (bvmul (_ bv2 64) .cse6) |c_ULTIMATE.start_main_~v~0#1|))) (.cse4 (bvmul .cse6 (_ bv6 64)))) (or (not (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse2 .cse3 .cse4))) (bvsle .cse5 .cse1) (not (bvsle (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64)) .cse1)) (= (_ bv0 64) (bvadd .cse0 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse5) (_ bv2 64))) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse2 .cse3 .cse4)) (not (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)))))) is different from true Received shutdown request... [2023-12-25 00:56:44,647 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:56:44,664 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 00:56:45,668 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 00:56:45,868 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 00:56:45,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:56:45,890 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-25 00:56:45,893 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 00:56:45,894 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:56:45,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:56:45 BoogieIcfgContainer [2023-12-25 00:56:45,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:56:45,910 INFO L158 Benchmark]: Toolchain (without parser) took 888623.58ms. Allocated memory is still 249.6MB. Free memory was 203.0MB in the beginning and 155.6MB in the end (delta: 47.4MB). Peak memory consumption was 47.0MB. Max. memory is 8.0GB. [2023-12-25 00:56:45,910 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 181.4MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:56:45,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.44ms. Allocated memory is still 249.6MB. Free memory was 203.0MB in the beginning and 191.2MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:56:45,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.65ms. Allocated memory is still 249.6MB. Free memory was 191.2MB in the beginning and 189.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:56:45,911 INFO L158 Benchmark]: Boogie Preprocessor took 47.15ms. Allocated memory is still 249.6MB. Free memory was 189.7MB in the beginning and 187.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:56:45,911 INFO L158 Benchmark]: RCFGBuilder took 644.34ms. Allocated memory is still 249.6MB. Free memory was 187.7MB in the beginning and 174.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 00:56:45,911 INFO L158 Benchmark]: TraceAbstraction took 887736.65ms. Allocated memory is still 249.6MB. Free memory was 173.7MB in the beginning and 155.6MB in the end (delta: 18.0MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2023-12-25 00:56:45,912 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-12-25 00:56:45,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 181.4MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.44ms. Allocated memory is still 249.6MB. Free memory was 203.0MB in the beginning and 191.2MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.65ms. Allocated memory is still 249.6MB. Free memory was 191.2MB in the beginning and 189.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.15ms. Allocated memory is still 249.6MB. Free memory was 189.7MB in the beginning and 187.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 644.34ms. Allocated memory is still 249.6MB. Free memory was 187.7MB in the beginning and 174.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 887736.65ms. Allocated memory is still 249.6MB. Free memory was 173.7MB in the beginning and 155.6MB in the end (delta: 18.0MB). Peak memory consumption was 17.7MB. 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: 16]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16). Cancelled while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 887.7s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 291.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 155.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 152.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 44 IncrementalHoareTripleChecker+Unchecked, 363 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 806 IncrementalHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 47 mSDtfsCounter, 806 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 303.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 38.3s SatisfiabilityAnalysisTime, 302.7s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 2355 SizeOfPredicates, 21 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 26/52 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