/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/fermat2-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 02:28:44,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 02:28:44,956 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 02:28:44,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 02:28:44,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 02:28:44,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 02:28:44,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 02:28:44,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 02:28:44,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 02:28:44,992 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 02:28:44,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 02:28:44,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 02:28:44,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 02:28:44,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 02:28:44,994 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 02:28:44,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 02:28:44,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 02:28:44,995 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 02:28:44,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 02:28:44,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 02:28:44,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 02:28:44,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 02:28:44,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 02:28:44,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 02:28:44,997 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 02:28:44,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 02:28:44,997 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 02:28:44,997 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 02:28:44,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 02:28:44,998 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 02:28:44,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 02:28:44,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:28:44,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 02:28:44,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 02:28:45,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 02:28:45,000 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 02:28:45,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 02:28:45,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 02:28:45,000 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 02:28:45,000 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 02:28:45,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 02:28:45,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 02:28:45,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 02:28:45,216 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 02:28:45,216 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 02:28:45,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound10.c [2023-12-25 02:28:46,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 02:28:46,451 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 02:28:46,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound10.c [2023-12-25 02:28:46,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7166fa27/e32e12b7ebc7497da699a98eac2a6afc/FLAG4cb409826 [2023-12-25 02:28:46,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7166fa27/e32e12b7ebc7497da699a98eac2a6afc [2023-12-25 02:28:46,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 02:28:46,501 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 02:28:46,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 02:28:46,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 02:28:46,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 02:28:46,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788cb221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46, skipping insertion in model container [2023-12-25 02:28:46,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,531 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 02:28:46,640 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/fermat2-ll_valuebound10.c[524,537] [2023-12-25 02:28:46,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:28:46,663 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 02:28:46,671 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/fermat2-ll_valuebound10.c[524,537] [2023-12-25 02:28:46,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:28:46,696 INFO L206 MainTranslator]: Completed translation [2023-12-25 02:28:46,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46 WrapperNode [2023-12-25 02:28:46,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 02:28:46,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 02:28:46,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 02:28:46,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 02:28:46,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,733 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-12-25 02:28:46,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 02:28:46,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 02:28:46,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 02:28:46,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 02:28:46,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,759 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 02:28:46,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 02:28:46,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 02:28:46,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 02:28:46,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 02:28:46,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (1/1) ... [2023-12-25 02:28:46,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:28:46,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 02:28:46,806 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 02:28:46,848 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 02:28:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 02:28:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 02:28:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 02:28:46,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 02:28:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 02:28:46,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 02:28:46,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 02:28:46,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 02:28:46,904 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 02:28:46,907 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 02:28:47,123 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 02:28:47,147 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 02:28:47,148 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 02:28:47,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:28:47 BoogieIcfgContainer [2023-12-25 02:28:47,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 02:28:47,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 02:28:47,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 02:28:47,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 02:28:47,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 02:28:46" (1/3) ... [2023-12-25 02:28:47,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba52ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:28:47, skipping insertion in model container [2023-12-25 02:28:47,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:28:46" (2/3) ... [2023-12-25 02:28:47,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba52ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:28:47, skipping insertion in model container [2023-12-25 02:28:47,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:28:47" (3/3) ... [2023-12-25 02:28:47,155 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound10.c [2023-12-25 02:28:47,167 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 02:28:47,168 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 02:28:47,207 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 02:28:47,212 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;@51769001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 02:28:47,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 02:28:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 02:28:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 02:28:47,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:28:47,221 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:28:47,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:28:47,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:28:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1510333481, now seen corresponding path program 1 times [2023-12-25 02:28:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:28:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330526839] [2023-12-25 02:28:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:28:47,236 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 02:28:47,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:28:47,239 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 02:28:47,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 02:28:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:28:47,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 02:28:47,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:28:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 02:28:47,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:28:47,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:28:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330526839] [2023-12-25 02:28:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330526839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:28:47,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:28:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 02:28:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709355455] [2023-12-25 02:28:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:28:47,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 02:28:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:28:47,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 02:28:47,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:28:47,465 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:28:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:28:47,492 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-12-25 02:28:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 02:28:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 02:28:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:28:47,498 INFO L225 Difference]: With dead ends: 46 [2023-12-25 02:28:47,499 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 02:28:47,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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 02:28:47,504 INFO L413 NwaCegarLoop]: 27 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, 27 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 02:28:47,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 02:28:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 02:28:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 02:28:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 02:28:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-12-25 02:28:47,533 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 28 [2023-12-25 02:28:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:28:47,533 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-12-25 02:28:47,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:28:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-12-25 02:28:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 02:28:47,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:28:47,536 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:28:47,543 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 02:28:47,742 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 02:28:47,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:28:47,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:28:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash -369120531, now seen corresponding path program 1 times [2023-12-25 02:28:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:28:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000856565] [2023-12-25 02:28:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:28:47,745 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 02:28:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:28:47,748 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 02:28:47,766 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 02:28:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:28:47,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 02:28:47,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:29:17,567 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:29:32,331 WARN L293 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:29:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:29:41,683 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:29:41,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:29:41,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000856565] [2023-12-25 02:29:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000856565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:29:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:29:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 02:29:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987741924] [2023-12-25 02:29:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:29:41,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 02:29:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:29:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 02:29:41,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 02:29:41,686 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:30:03,725 WARN L293 SmtUtils]: Spent 15.93s on a formula simplification. DAG size of input: 32 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:30:05,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:30:07,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:30:08,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:30:11,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:30:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:30:14,853 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-12-25 02:30:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 02:30:14,860 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2023-12-25 02:30:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:30:14,862 INFO L225 Difference]: With dead ends: 33 [2023-12-25 02:30:14,862 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 02:30:14,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 46.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:30:14,863 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-12-25 02:30:14,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 97 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2023-12-25 02:30:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 02:30:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-12-25 02:30:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 02:30:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-12-25 02:30:14,870 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 28 [2023-12-25 02:30:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:30:14,871 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-12-25 02:30:14,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:30:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-12-25 02:30:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 02:30:14,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:30:14,873 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:30:14,883 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 02:30:15,073 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 02:30:15,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:30:15,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:30:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1928791027, now seen corresponding path program 1 times [2023-12-25 02:30:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:30:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954578590] [2023-12-25 02:30:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:30:15,074 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 02:30:15,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:30:15,076 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 02:30:15,078 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 02:30:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:30:15,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 02:30:15,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:30:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:30:25,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:30:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:30:47,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:30:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954578590] [2023-12-25 02:30:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954578590] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:30:47,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:30:47,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2023-12-25 02:30:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040545952] [2023-12-25 02:30:47,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:30:47,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 02:30:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:30:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 02:30:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 02:30:47,362 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 02:31:06,159 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 [0] [2023-12-25 02:31:39,593 WARN L293 SmtUtils]: Spent 12.53s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:31:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:31:40,525 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-12-25 02:31:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 02:31:40,551 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 34 [2023-12-25 02:31:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:31:40,553 INFO L225 Difference]: With dead ends: 41 [2023-12-25 02:31:40,553 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 02:31:40,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=98, Invalid=453, Unknown=1, NotChecked=0, Total=552 [2023-12-25 02:31:40,554 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:31:40,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 90 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-12-25 02:31:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 02:31:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-12-25 02:31:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 02:31:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-25 02:31:40,563 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2023-12-25 02:31:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:31:40,564 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-25 02:31:40,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 02:31:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-25 02:31:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 02:31:40,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:31:40,565 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:31:40,576 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 02:31:40,771 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 02:31:40,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:31:40,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:31:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1862368888, now seen corresponding path program 1 times [2023-12-25 02:31:40,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:31:40,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805692487] [2023-12-25 02:31:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:31:40,773 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 02:31:40,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:31:40,777 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 02:31:40,778 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 02:31:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:31:40,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 02:31:40,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:31:59,029 WARN L293 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:32:15,798 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:32:32,613 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:33:08,998 WARN L293 SmtUtils]: Spent 13.37s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:33:43,965 WARN L293 SmtUtils]: Spent 19.77s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:33:49,952 WARN L293 SmtUtils]: Spent 5.85s 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 02:34:01,268 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:34:32,828 WARN L293 SmtUtils]: Spent 20.48s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:35:01,891 WARN L293 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:35:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:35:13,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:36:06,862 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 02:36:26,260 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-12-25 02:36:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:36:29,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:36:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805692487] [2023-12-25 02:36:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805692487] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:36:29,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:36:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 21 [2023-12-25 02:36:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305675219] [2023-12-25 02:36:29,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:36:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 02:36:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:36:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 02:36:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=348, Unknown=7, NotChecked=0, Total=420 [2023-12-25 02:36:29,477 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 21 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 7 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:36:42,035 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 02:36:45,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:36:49,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:36:53,112 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 02:37:42,930 WARN L293 SmtUtils]: Spent 19.44s on a formula simplification. DAG size of input: 32 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:37:46,992 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 [0] [2023-12-25 02:37:51,009 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 [0] [2023-12-25 02:37:55,029 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 [0] [2023-12-25 02:37:59,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:38:03,795 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 [0] [2023-12-25 02:38:07,799 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 [0] [2023-12-25 02:38:10,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:38:15,769 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 [0] [2023-12-25 02:39:16,566 WARN L293 SmtUtils]: Spent 35.63s on a formula simplification. DAG size of input: 41 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:39:18,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:40:16,915 WARN L293 SmtUtils]: Spent 35.02s on a formula simplification. DAG size of input: 44 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:40:19,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:23,257 WARN L293 SmtUtils]: Spent 41.36s on a formula simplification. DAG size of input: 53 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:41:24,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:26,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:27,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:29,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:31,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:34,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:36,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:40,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:41:44,174 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 [0] [2023-12-25 02:41:48,449 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 [0] [2023-12-25 02:42:13,807 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:42:15,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:42:20,021 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 [0] [2023-12-25 02:42:21,991 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 [0] [2023-12-25 02:42:26,423 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 02:42:30,442 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 02:42:33,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:42:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:42:34,124 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-12-25 02:42:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 02:42:34,160 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 7 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 36 [2023-12-25 02:42:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:42:34,161 INFO L225 Difference]: With dead ends: 45 [2023-12-25 02:42:34,161 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 02:42:34,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 430.4s TimeCoverageRelationStatistics Valid=136, Invalid=663, Unknown=13, NotChecked=0, Total=812 [2023-12-25 02:42:34,162 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 105.8s IncrementalHoareTripleChecker+Time [2023-12-25 02:42:34,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 178 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 15 Unknown, 0 Unchecked, 105.8s Time] [2023-12-25 02:42:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 02:42:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-12-25 02:42:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 02:42:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-12-25 02:42:34,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 36 [2023-12-25 02:42:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:42:34,174 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-12-25 02:42:34,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 7 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 02:42:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-12-25 02:42:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 02:42:34,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:42:34,175 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:42:34,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 02:42:34,383 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 02:42:34,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:42:34,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:42:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1470119521, now seen corresponding path program 1 times [2023-12-25 02:42:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:42:34,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792476191] [2023-12-25 02:42:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:42:34,385 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 02:42:34,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:42:34,386 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 02:42:34,390 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 02:42:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:42:34,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 02:42:34,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:42:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 02:42:41,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:42:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 02:42:42,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:42:42,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792476191] [2023-12-25 02:42:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792476191] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:42:42,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:42:42,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2023-12-25 02:42:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146583805] [2023-12-25 02:42:42,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:42:42,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 02:42:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:42:42,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 02:42:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:42:42,372 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-25 02:42:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:42:52,339 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2023-12-25 02:42:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 02:42:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 44 [2023-12-25 02:42:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:42:52,340 INFO L225 Difference]: With dead ends: 67 [2023-12-25 02:42:52,340 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 02:42:52,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-25 02:42:52,341 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-25 02:42:52,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 148 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-25 02:42:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 02:42:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2023-12-25 02:42:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 02:42:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2023-12-25 02:42:52,356 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 44 [2023-12-25 02:42:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:42:52,356 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2023-12-25 02:42:52,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-25 02:42:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2023-12-25 02:42:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 02:42:52,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:42:52,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:42:52,376 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 02:42:52,579 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 02:42:52,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:42:52,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:42:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash 420249340, now seen corresponding path program 2 times [2023-12-25 02:42:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:42:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422393854] [2023-12-25 02:42:52,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 02:42:52,581 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 02:42:52,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:42:52,582 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 02:42:52,620 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 02:42:52,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 02:42:52,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 02:42:52,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-25 02:42:52,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:43:11,427 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:43:29,731 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 02:43:33,944 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 02:43:33,963 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 02:43:34,980 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 (7)] Ended with exit code 0 [2023-12-25 02:43:35,181 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 02:43:35,197 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 [2023-12-25 02:43:35,199 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:43:35,199 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-25 02:43:35,202 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-12-25 02:43:35,204 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:43:35,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:43:35 BoogieIcfgContainer [2023-12-25 02:43:35,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:43:35,206 INFO L158 Benchmark]: Toolchain (without parser) took 888704.62ms. Allocated memory is still 357.6MB. Free memory was 316.5MB in the beginning and 149.3MB in the end (delta: 167.2MB). Peak memory consumption was 168.2MB. Max. memory is 8.0GB. [2023-12-25 02:43:35,206 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 207.6MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:43:35,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.17ms. Allocated memory is still 357.6MB. Free memory was 316.5MB in the beginning and 304.6MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 02:43:35,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.39ms. Allocated memory is still 357.6MB. Free memory was 304.6MB in the beginning and 303.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 02:43:35,206 INFO L158 Benchmark]: Boogie Preprocessor took 46.67ms. Allocated memory is still 357.6MB. Free memory was 302.9MB in the beginning and 301.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 02:43:35,207 INFO L158 Benchmark]: RCFGBuilder took 367.36ms. Allocated memory is still 357.6MB. Free memory was 301.3MB in the beginning and 288.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 02:43:35,207 INFO L158 Benchmark]: TraceAbstraction took 888056.05ms. Allocated memory is still 357.6MB. Free memory was 287.8MB in the beginning and 149.3MB in the end (delta: 138.5MB). Peak memory consumption was 139.9MB. Max. memory is 8.0GB. [2023-12-25 02:43:35,208 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.45ms. Allocated memory is still 207.6MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.17ms. Allocated memory is still 357.6MB. Free memory was 316.5MB in the beginning and 304.6MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.39ms. Allocated memory is still 357.6MB. Free memory was 304.6MB in the beginning and 303.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.67ms. Allocated memory is still 357.6MB. Free memory was 302.9MB in the beginning and 301.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 367.36ms. Allocated memory is still 357.6MB. Free memory was 301.3MB in the beginning and 288.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 888056.05ms. Allocated memory is still 357.6MB. Free memory was 287.8MB in the beginning and 149.3MB in the end (delta: 138.5MB). Peak memory consumption was 139.9MB. 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: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 888.0s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 461.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 130.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 540 SdHoareTripleChecker+Invalid, 127.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 453 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 588 IncrementalHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 87 mSDtfsCounter, 588 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 552.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 59, 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, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 382.3s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 276 ConstructedInterpolants, 20 QuantifiedInterpolants, 1834 SizeOfPredicates, 25 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 210/236 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