/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/neural-networks/softmax_8_safe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 10:32:56,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 10:32:56,957 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 10:32:56,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 10:32:56,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 10:32:56,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 10:32:56,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 10:32:56,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 10:32:56,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 10:32:56,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 10:32:56,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 10:32:56,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 10:32:56,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 10:32:56,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 10:32:56,989 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 10:32:56,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 10:32:56,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 10:32:56,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 10:32:56,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 10:32:56,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 10:32:56,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 10:32:56,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 10:32:56,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 10:32:56,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 10:32:56,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 10:32:56,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 10:32:56,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 10:32:56,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 10:32:56,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 10:32:56,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 10:32:56,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 10:32:56,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 10:32:56,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 10:32:56,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 10:32:56,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:32:56,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 10:32:56,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 10:32:56,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 10:32:56,995 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 10:32:56,996 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 10:32:56,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 10:32:56,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 10:32:56,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 10:32:56,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 10:32:56,997 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 10:32:57,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 10:32:57,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 10:32:57,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 10:32:57,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 10:32:57,227 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 10:32:57,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/softmax_8_safe.c-amalgamation.i [2024-11-03 10:32:58,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 10:32:58,864 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 10:32:58,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_8_safe.c-amalgamation.i [2024-11-03 10:32:58,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14450d489/d17088d0457b4149bb211aa671deb5ae/FLAG915b16336 [2024-11-03 10:32:58,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14450d489/d17088d0457b4149bb211aa671deb5ae [2024-11-03 10:32:58,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 10:32:58,906 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 10:32:58,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 10:32:58,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 10:32:58,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 10:32:58,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:32:58" (1/1) ... [2024-11-03 10:32:58,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe2eefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:58, skipping insertion in model container [2024-11-03 10:32:58,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:32:58" (1/1) ... [2024-11-03 10:32:58,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 10:32:59,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_8_safe.c-amalgamation.i[63746,63759] [2024-11-03 10:32:59,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:32:59,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 10:32:59,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/softmax_8_safe.c-amalgamation.i[63746,63759] [2024-11-03 10:32:59,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:32:59,654 INFO L204 MainTranslator]: Completed translation [2024-11-03 10:32:59,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59 WrapperNode [2024-11-03 10:32:59,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 10:32:59,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 10:32:59,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 10:32:59,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 10:32:59,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,721 INFO L138 Inliner]: procedures = 562, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 131 [2024-11-03 10:32:59,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 10:32:59,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 10:32:59,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 10:32:59,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 10:32:59,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,751 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 7, 4, 12]. 48 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 2, 4]. [2024-11-03 10:32:59,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 10:32:59,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 10:32:59,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 10:32:59,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 10:32:59,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (1/1) ... [2024-11-03 10:32:59,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:32:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 10:32:59,813 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 10:32:59,819 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 10:32:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-03 10:32:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-03 10:32:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-03 10:32:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-03 10:32:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 10:32:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 10:32:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 10:32:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-03 10:32:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 10:32:59,986 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 10:32:59,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 10:33:00,562 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-03 10:33:00,562 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 10:33:00,572 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 10:33:00,572 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-03 10:33:00,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:33:00 BoogieIcfgContainer [2024-11-03 10:33:00,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 10:33:00,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 10:33:00,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 10:33:00,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 10:33:00,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 10:32:58" (1/3) ... [2024-11-03 10:33:00,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233b23ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:33:00, skipping insertion in model container [2024-11-03 10:33:00,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:32:59" (2/3) ... [2024-11-03 10:33:00,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233b23ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:33:00, skipping insertion in model container [2024-11-03 10:33:00,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:33:00" (3/3) ... [2024-11-03 10:33:00,579 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_8_safe.c-amalgamation.i [2024-11-03 10:33:00,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 10:33:00,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 10:33:00,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 10:33:00,641 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;@64e10c17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 10:33:00,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 10:33:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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-03 10:33:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-03 10:33:00,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:00,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:00,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:00,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2096707609, now seen corresponding path program 1 times [2024-11-03 10:33:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776827512] [2024-11-03 10:33:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:00,668 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 10:33:00,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:00,670 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 10:33:00,671 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 10:33:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:33:00,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 10:33:00,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:33:00,849 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-03 10:33:00,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:33:00,857 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-03 10:33:00,858 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:33:00,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776827512] [2024-11-03 10:33:00,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [776827512] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:33:00,858 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:33:00,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 10:33:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584975201] [2024-11-03 10:33:00,864 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:33:00,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 10:33:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:33:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 10:33:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 10:33:00,891 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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-03 10:33:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:33:00,907 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2024-11-03 10:33:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 10:33:00,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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) Word has length 20 [2024-11-03 10:33:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:33:00,916 INFO L225 Difference]: With dead ends: 57 [2024-11-03 10:33:00,917 INFO L226 Difference]: Without dead ends: 26 [2024-11-03 10:33:00,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 10:33:00,923 INFO L432 NwaCegarLoop]: 34 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, 34 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 10:33:00,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 10:33:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-03 10:33:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-03 10:33:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-03 10:33:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-03 10:33:00,952 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2024-11-03 10:33:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:33:00,952 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-03 10:33:00,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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-03 10:33:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-03 10:33:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-03 10:33:00,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:00,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:00,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-03 10:33:01,154 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 10:33:01,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:01,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1671457263, now seen corresponding path program 1 times [2024-11-03 10:33:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:01,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330619914] [2024-11-03 10:33:01,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:01,157 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 10:33:01,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:01,158 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 10:33:01,159 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 10:33:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:33:01,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:33:01,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:33:01,353 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-03 10:33:01,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:33:01,371 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-03 10:33:01,371 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:33:01,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330619914] [2024-11-03 10:33:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1330619914] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:33:01,372 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:33:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 10:33:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680715388] [2024-11-03 10:33:01,373 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:33:01,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 10:33:01,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:33:01,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 10:33:01,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 10:33:01,375 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2024-11-03 10:33:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:33:01,959 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-03 10:33:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 10:33:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) Word has length 20 [2024-11-03 10:33:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:33:01,960 INFO L225 Difference]: With dead ends: 43 [2024-11-03 10:33:01,960 INFO L226 Difference]: Without dead ends: 30 [2024-11-03 10:33:01,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 10:33:01,962 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-03 10:33:01,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-03 10:33:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-03 10:33:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-03 10:33:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-03 10:33:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-03 10:33:01,968 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2024-11-03 10:33:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:33:01,968 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-03 10:33:01,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2024-11-03 10:33:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-03 10:33:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 10:33:01,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:01,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:01,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-03 10:33:02,170 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 10:33:02,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1128715665, now seen corresponding path program 1 times [2024-11-03 10:33:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160661837] [2024-11-03 10:33:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:02,172 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 10:33:02,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:02,176 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 10:33:02,177 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 10:33:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:33:02,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 10:33:02,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:33:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:33:02,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:33:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:33:02,564 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:33:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160661837] [2024-11-03 10:33:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1160661837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:33:02,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:33:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 10:33:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751764607] [2024-11-03 10:33:02,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:33:02,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 10:33:02,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:33:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 10:33:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 10:33:02,566 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-03 10:33:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:33:03,004 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-11-03 10:33:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 10:33:03,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 26 [2024-11-03 10:33:03,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:33:03,008 INFO L225 Difference]: With dead ends: 48 [2024-11-03 10:33:03,008 INFO L226 Difference]: Without dead ends: 35 [2024-11-03 10:33:03,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 10:33:03,010 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 10:33:03,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 10:33:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-03 10:33:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-03 10:33:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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-03 10:33:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-03 10:33:03,019 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 26 [2024-11-03 10:33:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:33:03,019 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-03 10:33:03,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-03 10:33:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-03 10:33:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-03 10:33:03,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:03,020 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:03,028 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 10:33:03,220 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 10:33:03,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:03,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1336706149, now seen corresponding path program 2 times [2024-11-03 10:33:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:03,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2126913480] [2024-11-03 10:33:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:03,222 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 10:33:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:03,225 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 10:33:03,226 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 10:33:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:33:03,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:33:03,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:33:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-03 10:33:03,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:33:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-03 10:33:03,517 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:33:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2126913480] [2024-11-03 10:33:03,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2126913480] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:33:03,517 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:33:03,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 10:33:03,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166227832] [2024-11-03 10:33:03,518 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:33:03,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 10:33:03,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:33:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 10:33:03,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-03 10:33:03,519 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-03 10:33:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:33:04,182 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-11-03 10:33:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 10:33:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 29 [2024-11-03 10:33:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:33:04,183 INFO L225 Difference]: With dead ends: 49 [2024-11-03 10:33:04,183 INFO L226 Difference]: Without dead ends: 39 [2024-11-03 10:33:04,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-03 10:33:04,184 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-03 10:33:04,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-03 10:33:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-03 10:33:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-03 10:33:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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-03 10:33:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-03 10:33:04,192 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 29 [2024-11-03 10:33:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:33:04,192 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-03 10:33:04,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-03 10:33:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-03 10:33:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-03 10:33:04,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:04,193 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:04,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-03 10:33:04,394 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 10:33:04,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:04,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 978520685, now seen corresponding path program 1 times [2024-11-03 10:33:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28766910] [2024-11-03 10:33:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:04,395 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 10:33:04,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:04,398 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 10:33:04,399 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 10:33:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:33:04,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 10:33:04,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:33:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 10:33:04,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:33:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 10:33:05,096 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:33:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28766910] [2024-11-03 10:33:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [28766910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:33:05,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:33:05,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 10:33:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288516899] [2024-11-03 10:33:05,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:33:05,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 10:33:05,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:33:05,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 10:33:05,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-03 10:33:05,102 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-03 10:33:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:33:07,675 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-11-03 10:33:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 10:33:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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 37 [2024-11-03 10:33:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:33:07,679 INFO L225 Difference]: With dead ends: 60 [2024-11-03 10:33:07,680 INFO L226 Difference]: Without dead ends: 47 [2024-11-03 10:33:07,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-03 10:33:07,681 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-03 10:33:07,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 101 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-03 10:33:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-03 10:33:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-03 10:33:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 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-03 10:33:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-03 10:33:07,693 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 37 [2024-11-03 10:33:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:33:07,693 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-03 10:33:07,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-03 10:33:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-03 10:33:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-03 10:33:07,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:07,696 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:07,715 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 10:33:07,897 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 10:33:07,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:07,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1132771211, now seen corresponding path program 2 times [2024-11-03 10:33:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525735230] [2024-11-03 10:33:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:07,898 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 10:33:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:07,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 10:33:07,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-03 10:33:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:33:08,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 10:33:08,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:33:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-03 10:33:08,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:33:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-03 10:33:08,618 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:33:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525735230] [2024-11-03 10:33:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1525735230] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:33:08,618 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:33:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 10:33:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901405555] [2024-11-03 10:33:08,619 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:33:08,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 10:33:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:33:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 10:33:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 10:33:08,620 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03 10:33:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:33:08,758 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-03 10:33:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 10:33:08,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 45 [2024-11-03 10:33:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:33:08,760 INFO L225 Difference]: With dead ends: 54 [2024-11-03 10:33:08,761 INFO L226 Difference]: Without dead ends: 50 [2024-11-03 10:33:08,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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 10:33:08,762 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 10:33:08,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 10:33:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-03 10:33:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-03 10:33:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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-03 10:33:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-03 10:33:08,770 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 45 [2024-11-03 10:33:08,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:33:08,770 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-03 10:33:08,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03 10:33:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-03 10:33:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-03 10:33:08,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:08,771 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:08,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-03 10:33:08,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 10:33:08,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:08,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash -259246791, now seen corresponding path program 1 times [2024-11-03 10:33:08,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:08,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469850995] [2024-11-03 10:33:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:08,973 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 10:33:08,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:08,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 10:33:08,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-03 10:33:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:33:09,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:33:09,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:33:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-03 10:33:09,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:33:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-03 10:33:09,832 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:33:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469850995] [2024-11-03 10:33:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1469850995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:33:09,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:33:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 10:33:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039510940] [2024-11-03 10:33:09,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:33:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 10:33:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:33:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 10:33:09,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-03 10:33:09,835 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-03 10:33:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:33:10,069 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-11-03 10:33:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 10:33:10,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 49 [2024-11-03 10:33:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:33:10,072 INFO L225 Difference]: With dead ends: 58 [2024-11-03 10:33:10,072 INFO L226 Difference]: Without dead ends: 54 [2024-11-03 10:33:10,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-03 10:33:10,073 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 10:33:10,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 10:33:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-03 10:33:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-03 10:33:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 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-03 10:33:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-11-03 10:33:10,083 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 49 [2024-11-03 10:33:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:33:10,087 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-11-03 10:33:10,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-03 10:33:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-11-03 10:33:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-03 10:33:10,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:33:10,089 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:33:10,116 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 (8)] Forceful destruction successful, exit code 0 [2024-11-03 10:33:10,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 10:33:10,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:33:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:33:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1525604355, now seen corresponding path program 2 times [2024-11-03 10:33:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:33:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59143251] [2024-11-03 10:33:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:33:10,291 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 10:33:10,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:33:10,293 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 10:33:10,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-03 10:33:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:33:14,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 10:33:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:33:15,309 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 10:33:15,309 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 10:33:15,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 10:33:15,352 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 (9)] Forceful destruction successful, exit code 0 [2024-11-03 10:33:15,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 10:33:15,515 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2024-11-03 10:33:15,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 10:33:15,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 10:33:15 BoogieIcfgContainer [2024-11-03 10:33:15,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 10:33:15,566 INFO L158 Benchmark]: Toolchain (without parser) took 16660.06ms. Allocated memory is still 300.9MB. Free memory was 246.9MB in the beginning and 125.0MB in the end (delta: 121.9MB). Peak memory consumption was 122.2MB. Max. memory is 8.0GB. [2024-11-03 10:33:15,566 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 10:33:15,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 747.32ms. Allocated memory is still 300.9MB. Free memory was 246.6MB in the beginning and 239.3MB in the end (delta: 7.3MB). Peak memory consumption was 46.2MB. Max. memory is 8.0GB. [2024-11-03 10:33:15,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.40ms. Allocated memory is still 300.9MB. Free memory was 239.3MB in the beginning and 236.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 10:33:15,566 INFO L158 Benchmark]: Boogie Preprocessor took 52.77ms. Allocated memory is still 300.9MB. Free memory was 236.2MB in the beginning and 233.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 10:33:15,567 INFO L158 Benchmark]: RCFGBuilder took 796.94ms. Allocated memory is still 300.9MB. Free memory was 233.0MB in the beginning and 216.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-03 10:33:15,567 INFO L158 Benchmark]: TraceAbstraction took 14991.24ms. Allocated memory is still 300.9MB. Free memory was 215.7MB in the beginning and 125.0MB in the end (delta: 90.8MB). Peak memory consumption was 90.8MB. Max. memory is 8.0GB. [2024-11-03 10:33:15,568 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.13ms. Allocated memory is still 198.2MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 747.32ms. Allocated memory is still 300.9MB. Free memory was 246.6MB in the beginning and 239.3MB in the end (delta: 7.3MB). Peak memory consumption was 46.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.40ms. Allocated memory is still 300.9MB. Free memory was 239.3MB in the beginning and 236.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.77ms. Allocated memory is still 300.9MB. Free memory was 236.2MB in the beginning and 233.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 796.94ms. Allocated memory is still 300.9MB. Free memory was 233.0MB in the beginning and 216.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14991.24ms. Allocated memory is still 300.9MB. Free memory was 215.7MB in the beginning and 125.0MB in the end (delta: 90.8MB). Peak memory consumption was 90.8MB. 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: 878]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of expf at line 854, overapproximation of __builtin_isinf_sign at line 871. Possible FailurePath: [L863] float x[4], y[4]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] x[2] = __VERIFIER_nondet_float() [L867] x[3] = __VERIFIER_nondet_float() [L868] EXPR x[0] [L868] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L869] EXPR x[1] [L869] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L870] EXPR x[2] [L870] COND FALSE !(!(!__builtin_isnan (x[2]) && !__builtin_isinf_sign (x[2]))) [L871] EXPR x[3] [L871] COND FALSE !(!(!__builtin_isnan (x[3]) && !__builtin_isinf_sign (x[3]))) [L872] CALL softmax(x, y, 4) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=0.0, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=1, max=2.0, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=2.0, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=2, max=36893496943512125000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=3, max=36893496943512125000, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=3, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=4, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, sum=0.0, x={-2147483648:0}, y={3:0}] [L872] RET softmax(x, y, 4) [L873] int i; [L874] float sum = 0.0f; [L875] i = 0 VAL [i=0, sum=0.0, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] VAL [i=0, sum=NaN, y={3:0}] [L875] ++i VAL [i=1, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] VAL [i=1, sum=NaN, y={3:0}] [L875] ++i VAL [i=2, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] VAL [i=2, sum=NaN, y={3:0}] [L875] ++i VAL [i=3, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] VAL [i=3, sum=NaN, y={3:0}] [L875] ++i VAL [i=4, sum=NaN, y={3:0}] [L875] COND FALSE !(i < 4) VAL [sum=NaN, y={3:0}] [L877] float diff = fabsf(sum - 1.0f); VAL [diff=NaN, y={3:0}] [L878] COND TRUE !(__builtin_islessequal(diff, 1e-5f)) VAL [y={3:0}] [L878] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 557 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 183 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=7, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 816 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 232/258 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 10:33:15,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...