/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:38:00,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:38:00,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:38:00,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:38:00,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:38:00,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:38:00,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:38:00,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:38:00,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:38:00,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:38:00,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:38:00,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:38:00,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:38:00,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:38:00,309 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:38:00,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:38:00,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:38:00,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:38:00,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:38:00,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:38:00,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:38:00,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:38:00,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:38:00,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:38:00,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:38:00,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:38:00,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:38:00,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:38:00,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:38:00,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:38:00,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:38:00,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:38:00,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:38:00,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:38:00,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:38:00,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:38:00,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:38:00,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:38:00,317 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:38:00,317 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:38:00,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:38:00,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:38:00,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:38:00,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:38:00,318 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 [2024-11-05 20:38:00,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:38:00,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:38:00,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:38:00,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:38:00,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:38:00,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-05 20:38:02,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:38:02,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:38:02,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-05 20:38:02,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cb01bf9/0e5c92b4c1ed49eba91df9e44d40d181/FLAG207b0c569 [2024-11-05 20:38:02,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cb01bf9/0e5c92b4c1ed49eba91df9e44d40d181 [2024-11-05 20:38:02,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:38:02,204 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:38:02,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:38:02,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:38:02,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:38:02,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23625ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02, skipping insertion in model container [2024-11-05 20:38:02,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:38:02,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-05 20:38:02,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:38:02,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:38:02,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-05 20:38:02,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:38:02,454 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:38:02,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02 WrapperNode [2024-11-05 20:38:02,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:38:02,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:38:02,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:38:02,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:38:02,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,484 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-11-05 20:38:02,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:38:02,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:38:02,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:38:02,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:38:02,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,505 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]. [2024-11-05 20:38:02,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:38:02,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:38:02,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:38:02,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:38:02,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (1/1) ... [2024-11-05 20:38:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:38:02,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:38:02,550 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) [2024-11-05 20:38:02,553 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 [2024-11-05 20:38:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:38:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:38:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:38:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:38:02,652 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:38:02,654 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:38:06,924 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-05 20:38:06,925 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:38:06,943 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:38:06,943 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-05 20:38:06,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:38:06 BoogieIcfgContainer [2024-11-05 20:38:06,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:38:06,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:38:06,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:38:06,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:38:06,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:38:02" (1/3) ... [2024-11-05 20:38:06,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cab7e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:38:06, skipping insertion in model container [2024-11-05 20:38:06,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:38:02" (2/3) ... [2024-11-05 20:38:06,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cab7e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:38:06, skipping insertion in model container [2024-11-05 20:38:06,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:38:06" (3/3) ... [2024-11-05 20:38:06,952 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2024-11-05 20:38:06,970 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:38:06,970 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:38:07,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:38:07,031 INFO L333 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, 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;@160b2d2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:38:07,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:38:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-05 20:38:07,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:07,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:07,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:07,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1824272086, now seen corresponding path program 1 times [2024-11-05 20:38:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:07,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371792539] [2024-11-05 20:38:07,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:07,054 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 [2024-11-05 20:38:07,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:07,056 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) [2024-11-05 20:38:07,058 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 [2024-11-05 20:38:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:07,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:38:07,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:07,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:07,225 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:07,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371792539] [2024-11-05 20:38:07,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1371792539] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:38:07,226 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:38:07,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:38:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803905921] [2024-11-05 20:38:07,256 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:38:07,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:38:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:38:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:38:07,289 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:07,357 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2024-11-05 20:38:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:38:07,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-05 20:38:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:07,368 INFO L225 Difference]: With dead ends: 37 [2024-11-05 20:38:07,369 INFO L226 Difference]: Without dead ends: 15 [2024-11-05 20:38:07,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:38:07,374 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:07,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:38:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-05 20:38:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-05 20:38:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-05 20:38:07,398 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2024-11-05 20:38:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:07,398 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-05 20:38:07,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-05 20:38:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-05 20:38:07,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:07,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:07,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 20:38:07,600 WARN L453 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 [2024-11-05 20:38:07,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2000333105, now seen corresponding path program 1 times [2024-11-05 20:38:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:07,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267074354] [2024-11-05 20:38:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:07,602 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 [2024-11-05 20:38:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:07,605 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) [2024-11-05 20:38:07,607 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 [2024-11-05 20:38:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:07,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:38:07,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:07,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:07,871 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267074354] [2024-11-05 20:38:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [267074354] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:38:07,871 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:38:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:38:07,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403116894] [2024-11-05 20:38:07,872 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:38:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:38:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:38:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:38:07,874 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:07,981 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-11-05 20:38:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:38:07,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-05 20:38:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:07,982 INFO L225 Difference]: With dead ends: 19 [2024-11-05 20:38:07,982 INFO L226 Difference]: Without dead ends: 17 [2024-11-05 20:38:07,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:38:07,984 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:07,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:38:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-05 20:38:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-05 20:38:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-05 20:38:07,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2024-11-05 20:38:07,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:07,989 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-05 20:38:07,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-05 20:38:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-05 20:38:07,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:07,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:07,995 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 [2024-11-05 20:38:08,191 WARN L453 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 [2024-11-05 20:38:08,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1983322444, now seen corresponding path program 1 times [2024-11-05 20:38:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:08,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639162046] [2024-11-05 20:38:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:08,193 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 [2024-11-05 20:38:08,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:08,195 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) [2024-11-05 20:38:08,196 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 [2024-11-05 20:38:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:08,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:38:08,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:08,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:08,365 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:38:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639162046] [2024-11-05 20:38:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1639162046] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:38:08,366 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:38:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:38:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818679654] [2024-11-05 20:38:08,366 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:38:08,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:38:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:38:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:38:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:38:08,368 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:38:09,646 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-11-05 20:38:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:38:09,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-05 20:38:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:38:09,647 INFO L225 Difference]: With dead ends: 52 [2024-11-05 20:38:09,647 INFO L226 Difference]: Without dead ends: 37 [2024-11-05 20:38:09,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:38:09,649 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:38:09,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-05 20:38:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-05 20:38:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2024-11-05 20:38:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-05 20:38:09,654 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2024-11-05 20:38:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:38:09,654 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-05 20:38:09,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:38:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-05 20:38:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-05 20:38:09,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:38:09,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:38:09,658 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 [2024-11-05 20:38:09,856 WARN L453 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 [2024-11-05 20:38:09,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:38:09,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:38:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1270566899, now seen corresponding path program 1 times [2024-11-05 20:38:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:38:09,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399473891] [2024-11-05 20:38:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:38:09,858 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 [2024-11-05 20:38:09,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:38:09,861 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) [2024-11-05 20:38:09,862 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 [2024-11-05 20:38:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:38:10,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 20:38:10,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:38:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:38:11,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:38:19,312 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:38:23,349 WARN L851 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2024-11-05 20:38:27,387 WARN L873 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2024-11-05 20:38:34,274 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:38:41,691 WARN L286 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:38:49,770 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:38:53,809 WARN L851 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2024-11-05 20:38:57,850 WARN L873 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2024-11-05 20:39:06,005 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:39:14,142 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:39:22,227 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:39:26,281 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2024-11-05 20:39:34,437 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:39:42,575 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:39:50,663 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-05 20:39:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:39:50,710 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:39:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399473891] [2024-11-05 20:39:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1399473891] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:39:50,710 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:39:50,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2024-11-05 20:39:50,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366823393] [2024-11-05 20:39:50,711 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:39:50,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 20:39:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:39:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 20:39:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=30, Unknown=5, NotChecked=42, Total=110 [2024-11-05 20:39:50,713 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)