/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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 07:50:05,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 07:50:05,846 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-03 07:50:05,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 07:50:05,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 07:50:05,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 07:50:05,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 07:50:05,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 07:50:05,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 07:50:05,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 07:50:05,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 07:50:05,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 07:50:05,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 07:50:05,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 07:50:05,870 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 07:50:05,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 07:50:05,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 07:50:05,871 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 07:50:05,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 07:50:05,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 07:50:05,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 07:50:05,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 07:50:05,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 07:50:05,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 07:50:05,872 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 07:50:05,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 07:50:05,873 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 07:50:05,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 07:50:05,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 07:50:05,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 07:50:05,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 07:50:05,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 07:50:05,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 07:50:05,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 07:50:05,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 07:50:05,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 07:50:05,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 07:50:05,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 07:50:05,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 07:50:05,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 07:50:05,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 07:50:05,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 07:50:05,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 07:50:05,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 07:50:05,878 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-03 07:50:06,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 07:50:06,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 07:50:06,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 07:50:06,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 07:50:06,079 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 07:50:06,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i [2024-11-03 07:50:07,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 07:50:07,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 07:50:07,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i [2024-11-03 07:50:07,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7398aa74/d321567c2fc84e288e8b20f2973cbab7/FLAGb64f48b45 [2024-11-03 07:50:07,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7398aa74/d321567c2fc84e288e8b20f2973cbab7 [2024-11-03 07:50:07,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 07:50:07,493 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 07:50:07,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 07:50:07,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 07:50:07,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 07:50:07,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d75cb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07, skipping insertion in model container [2024-11-03 07:50:07,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 07:50:07,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i[916,929] [2024-11-03 07:50:07,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 07:50:07,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 07:50:07,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-76.i[916,929] [2024-11-03 07:50:07,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 07:50:07,731 INFO L204 MainTranslator]: Completed translation [2024-11-03 07:50:07,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07 WrapperNode [2024-11-03 07:50:07,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 07:50:07,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 07:50:07,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 07:50:07,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 07:50:07,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,762 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-03 07:50:07,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 07:50:07,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 07:50:07,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 07:50:07,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 07:50:07,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,789 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-03 07:50:07,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 07:50:07,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 07:50:07,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 07:50:07,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 07:50:07,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (1/1) ... [2024-11-03 07:50:07,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 07:50:07,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 07:50:07,843 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-03 07:50:07,846 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-03 07:50:07,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 07:50:07,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 07:50:07,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 07:50:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 07:50:07,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 07:50:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 07:50:07,934 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 07:50:07,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 07:50:09,748 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-03 07:50:09,748 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 07:50:09,757 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 07:50:09,757 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 07:50:09,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 07:50:09 BoogieIcfgContainer [2024-11-03 07:50:09,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 07:50:09,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 07:50:09,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 07:50:09,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 07:50:09,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 07:50:07" (1/3) ... [2024-11-03 07:50:09,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cdc662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 07:50:09, skipping insertion in model container [2024-11-03 07:50:09,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 07:50:07" (2/3) ... [2024-11-03 07:50:09,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cdc662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 07:50:09, skipping insertion in model container [2024-11-03 07:50:09,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 07:50:09" (3/3) ... [2024-11-03 07:50:09,765 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-76.i [2024-11-03 07:50:09,777 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 07:50:09,777 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 07:50:09,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 07:50:09,825 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;@162a5a8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 07:50:09,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 07:50:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 07:50:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-03 07:50:09,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:50:09,837 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:50:09,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:50:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:50:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -882179527, now seen corresponding path program 1 times [2024-11-03 07:50:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:50:09,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643682841] [2024-11-03 07:50:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:50:09,849 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-03 07:50:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:50:09,852 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-03 07:50:09,853 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-03 07:50:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:50:10,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 07:50:10,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:50:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-03 07:50:10,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:50:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-03 07:50:10,180 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:50:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643682841] [2024-11-03 07:50:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [643682841] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 07:50:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 07:50:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-03 07:50:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720176241] [2024-11-03 07:50:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 07:50:10,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 07:50:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:50:10,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 07:50:10,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 07:50:10,205 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-03 07:50:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:50:10,225 INFO L93 Difference]: Finished difference Result 97 states and 166 transitions. [2024-11-03 07:50:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 07:50:10,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-03 07:50:10,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:50:10,231 INFO L225 Difference]: With dead ends: 97 [2024-11-03 07:50:10,231 INFO L226 Difference]: Without dead ends: 48 [2024-11-03 07:50:10,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 07:50:10,238 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 07:50:10,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 07:50:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-03 07:50:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-03 07:50:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 07:50:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-11-03 07:50:10,266 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 102 [2024-11-03 07:50:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:50:10,266 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-11-03 07:50:10,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-03 07:50:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-11-03 07:50:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-03 07:50:10,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:50:10,269 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:50:10,277 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-03 07:50:10,469 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-03 07:50:10,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:50:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:50:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash 199022833, now seen corresponding path program 1 times [2024-11-03 07:50:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:50:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [756277042] [2024-11-03 07:50:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:50:10,472 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-03 07:50:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:50:10,474 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-03 07:50:10,475 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-03 07:50:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:50:10,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 07:50:10,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:50:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-03 07:50:10,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:50:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-03 07:50:10,973 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:50:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [756277042] [2024-11-03 07:50:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [756277042] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 07:50:10,974 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 07:50:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2024-11-03 07:50:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208867046] [2024-11-03 07:50:10,974 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 07:50:10,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 07:50:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:50:10,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 07:50:10,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 07:50:10,977 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-03 07:50:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:50:12,750 INFO L93 Difference]: Finished difference Result 150 states and 220 transitions. [2024-11-03 07:50:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 07:50:12,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 103 [2024-11-03 07:50:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:50:12,769 INFO L225 Difference]: With dead ends: 150 [2024-11-03 07:50:12,769 INFO L226 Difference]: Without dead ends: 105 [2024-11-03 07:50:12,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 07:50:12,771 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-03 07:50:12,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 239 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-03 07:50:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-03 07:50:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 48. [2024-11-03 07:50:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 07:50:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-03 07:50:12,784 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2024-11-03 07:50:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:50:12,785 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-03 07:50:12,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-03 07:50:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-03 07:50:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-03 07:50:12,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:50:12,789 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:50:12,797 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-03 07:50:12,989 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-03 07:50:12,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:50:12,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:50:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash -194004177, now seen corresponding path program 1 times [2024-11-03 07:50:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:50:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71476528] [2024-11-03 07:50:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:50:12,991 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-03 07:50:12,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:50:12,993 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-03 07:50:12,994 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-03 07:50:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:50:13,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 07:50:13,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:50:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-03 07:50:13,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:50:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-03 07:50:13,249 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:50:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71476528] [2024-11-03 07:50:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [71476528] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 07:50:13,249 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 07:50:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 07:50:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572969540] [2024-11-03 07:50:13,250 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 07:50:13,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 07:50:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:50:13,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 07:50:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 07:50:13,252 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-03 07:50:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:50:13,668 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2024-11-03 07:50:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 07:50:13,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-11-03 07:50:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:50:13,687 INFO L225 Difference]: With dead ends: 93 [2024-11-03 07:50:13,687 INFO L226 Difference]: Without dead ends: 48 [2024-11-03 07:50:13,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 07:50:13,688 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 07:50:13,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 07:50:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-03 07:50:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-03 07:50:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 07:50:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-03 07:50:13,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 103 [2024-11-03 07:50:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:50:13,694 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-03 07:50:13,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-03 07:50:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-03 07:50:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-03 07:50:13,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:50:13,696 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:50:13,703 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-03 07:50:13,899 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-03 07:50:13,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:50:13,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:50:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash -717862088, now seen corresponding path program 1 times [2024-11-03 07:50:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:50:13,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1437351097] [2024-11-03 07:50:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:50:13,901 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-03 07:50:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:50:13,903 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-03 07:50:13,904 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-03 07:50:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 07:50:14,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 07:50:14,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 07:50:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-03 07:50:14,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 07:50:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-03 07:50:14,351 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 07:50:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1437351097] [2024-11-03 07:50:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1437351097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 07:50:14,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 07:50:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-03 07:50:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436244889] [2024-11-03 07:50:14,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 07:50:14,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 07:50:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 07:50:14,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 07:50:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 07:50:14,353 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-03 07:50:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 07:50:15,519 INFO L93 Difference]: Finished difference Result 139 states and 191 transitions. [2024-11-03 07:50:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-03 07:50:15,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 104 [2024-11-03 07:50:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 07:50:15,522 INFO L225 Difference]: With dead ends: 139 [2024-11-03 07:50:15,522 INFO L226 Difference]: Without dead ends: 94 [2024-11-03 07:50:15,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-03 07:50:15,525 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 56 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-03 07:50:15,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 166 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-03 07:50:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-03 07:50:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 51. [2024-11-03 07:50:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 07:50:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-11-03 07:50:15,535 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 104 [2024-11-03 07:50:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 07:50:15,535 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-03 07:50:15,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-03 07:50:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-03 07:50:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-03 07:50:15,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 07:50:15,537 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 07:50:15,547 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 [2024-11-03 07:50:15,737 WARN L453 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 [2024-11-03 07:50:15,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 07:50:15,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 07:50:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -660603786, now seen corresponding path program 1 times [2024-11-03 07:50:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 07:50:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [725539152] [2024-11-03 07:50:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 07:50:15,739 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-03 07:50:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 07:50:15,740 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) [2024-11-03 07:50:15,742 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 [2024-11-03 07:50:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 07:50:15,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 07:50:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 07:50:15,964 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-03 07:50:15,964 WARN L124 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2024-11-03 07:50:15,964 INFO L325 BasicCegarLoop]: Counterexample might be feasible [2024-11-03 07:50:15,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 07:50:15,982 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 [2024-11-03 07:50:16,170 WARN L453 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 [2024-11-03 07:50:16,174 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-03 07:50:16,185 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 07:50:16,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 07:50:16 BoogieIcfgContainer [2024-11-03 07:50:16,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 07:50:16,187 INFO L158 Benchmark]: Toolchain (without parser) took 8694.16ms. Allocated memory is still 323.0MB. Free memory was 268.8MB in the beginning and 103.0MB in the end (delta: 165.7MB). Peak memory consumption was 166.8MB. Max. memory is 8.0GB. [2024-11-03 07:50:16,187 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 07:50:16,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.38ms. Allocated memory is still 323.0MB. Free memory was 268.8MB in the beginning and 254.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-03 07:50:16,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.73ms. Allocated memory is still 323.0MB. Free memory was 254.1MB in the beginning and 252.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 07:50:16,188 INFO L158 Benchmark]: Boogie Preprocessor took 51.71ms. Allocated memory is still 323.0MB. Free memory was 252.0MB in the beginning and 249.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 07:50:16,188 INFO L158 Benchmark]: RCFGBuilder took 1941.94ms. Allocated memory is still 323.0MB. Free memory was 249.4MB in the beginning and 233.1MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-03 07:50:16,189 INFO L158 Benchmark]: TraceAbstraction took 6427.41ms. Allocated memory is still 323.0MB. Free memory was 232.6MB in the beginning and 103.0MB in the end (delta: 129.6MB). Peak memory consumption was 130.1MB. Max. memory is 8.0GB. [2024-11-03 07:50:16,190 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.09ms. Allocated memory is still 197.1MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.38ms. Allocated memory is still 323.0MB. Free memory was 268.8MB in the beginning and 254.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.73ms. Allocated memory is still 323.0MB. Free memory was 254.1MB in the beginning and 252.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.71ms. Allocated memory is still 323.0MB. Free memory was 252.0MB in the beginning and 249.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1941.94ms. Allocated memory is still 323.0MB. Free memory was 249.4MB in the beginning and 233.1MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6427.41ms. Allocated memory is still 323.0MB. Free memory was 232.6MB in the beginning and 103.0MB in the end (delta: 129.6MB). Peak memory consumption was 130.1MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 8; [L24] signed long int var_1_4 = -2; [L25] unsigned char var_1_5 = 0; [L26] signed long int var_1_6 = 31; [L27] signed long int var_1_7 = 1000000000; [L28] signed char var_1_8 = -4; [L29] signed char var_1_9 = 5; [L30] signed char var_1_10 = 10; [L31] signed char var_1_11 = 5; [L32] unsigned char var_1_12 = 1; [L33] unsigned char var_1_13 = 1; [L34] signed char last_1_var_1_8 = -4; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_8 = var_1_8 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_3 >= 0) [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(var_1_3 >= 0) [L74] CALL assume_abort_if_not(var_1_3 <= 255) [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_3 <= 255) [L75] var_1_4 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_4 >= -2147483648) [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not(var_1_4 >= -2147483648) [L77] CALL assume_abort_if_not(var_1_4 <= 2147483647) [L20] COND FALSE !(!cond) [L77] RET assume_abort_if_not(var_1_4 <= 2147483647) [L78] var_1_5 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_5 >= 0) [L20] COND FALSE !(!cond) [L79] RET assume_abort_if_not(var_1_5 >= 0) [L80] CALL assume_abort_if_not(var_1_5 <= 0) [L20] COND FALSE !(!cond) [L80] RET assume_abort_if_not(var_1_5 <= 0) [L81] var_1_7 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_7 >= 0) [L20] COND FALSE !(!cond) [L82] RET assume_abort_if_not(var_1_7 >= 0) [L83] CALL assume_abort_if_not(var_1_7 <= 2147483647) [L20] COND FALSE !(!cond) [L83] RET assume_abort_if_not(var_1_7 <= 2147483647) [L84] var_1_9 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_9 >= -127) [L20] COND FALSE !(!cond) [L85] RET assume_abort_if_not(var_1_9 >= -127) [L86] CALL assume_abort_if_not(var_1_9 <= 126) [L20] COND FALSE !(!cond) [L86] RET assume_abort_if_not(var_1_9 <= 126) [L87] var_1_10 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_10 >= -127) [L20] COND FALSE !(!cond) [L88] RET assume_abort_if_not(var_1_10 >= -127) [L89] CALL assume_abort_if_not(var_1_10 <= 126) [L20] COND FALSE !(!cond) [L89] RET assume_abort_if_not(var_1_10 <= 126) [L90] var_1_11 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_11 >= -1) [L20] COND FALSE !(!cond) [L91] RET assume_abort_if_not(var_1_11 >= -1) [L92] CALL assume_abort_if_not(var_1_11 <= 126) [L20] COND FALSE !(!cond) [L92] RET assume_abort_if_not(var_1_11 <= 126) [L93] var_1_13 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_13 >= 1) [L20] COND FALSE !(!cond) [L94] RET assume_abort_if_not(var_1_13 >= 1) [L95] CALL assume_abort_if_not(var_1_13 <= 1) [L20] COND FALSE !(!cond) [L95] RET assume_abort_if_not(var_1_13 <= 1) [L109] RET updateVariables() [L110] CALL step() [L38] signed long int stepLocal_0 = (- 5) + last_1_var_1_8; [L39] COND FALSE !(stepLocal_0 >= last_1_var_1_8) [L42] var_1_1 = var_1_5 [L44] COND FALSE !(-25 >= var_1_3) [L47] COND TRUE var_1_10 == var_1_4 [L48] var_1_8 = (var_1_11 - 16) [L55] signed char stepLocal_1 = var_1_8; [L56] COND TRUE stepLocal_1 <= var_1_8 [L57] COND FALSE !(\read(var_1_1)) [L61] COND FALSE !(\read(var_1_1)) [L68] var_1_12 = var_1_13 [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((((- 5) + last_1_var_1_8) >= last_1_var_1_8) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_8 <= var_1_8) ? (var_1_1 ? (var_1_6 == ((signed long int) (3.17 - ((((127.2) > (var_1_7)) ? (127.2) : (var_1_7)))))) : 1) : 1)) && ((-25 >= var_1_3) ? (var_1_8 == ((signed char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((var_1_10 == var_1_4) ? (var_1_8 == ((signed char) (var_1_11 - 16))) : (var_1_1 ? (var_1_8 == ((signed char) var_1_9)) : 1)))) && (var_1_1 ? (((var_1_7 >= 24.2) || var_1_5) ? (var_1_12 == ((unsigned char) (var_1_5 || (! var_1_13)))) : (var_1_12 == ((unsigned char) var_1_5))) : (var_1_12 == ((unsigned char) var_1_13))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 662 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 280 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 831 GetRequests, 805 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 100 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 6 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 3768/3840 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: unable to determine feasibility of some traces [2024-11-03 07:50:16,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...