./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 482b3fdef5f1e71e1007340a4f7a341f28794f7d99258d661ab845ef474c148c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:42:16,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:42:16,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:42:16,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:42:16,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:42:16,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:42:16,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:42:16,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:42:16,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:42:16,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:42:16,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:42:16,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:42:16,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:42:16,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:42:16,690 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:42:16,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:42:16,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:42:16,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:42:16,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:42:16,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:42:16,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:42:16,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:42:16,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:42:16,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:42:16,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:42:16,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:42:16,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:42:16,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:42:16,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:42:16,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:42:16,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:42:16,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:42:16,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:42:16,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:42:16,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:42:16,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:42:16,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:42:16,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:42:16,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:42:16,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:42:16,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:42:16,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:42:16,697 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 482b3fdef5f1e71e1007340a4f7a341f28794f7d99258d661ab845ef474c148c [2024-11-16 12:42:16,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:42:16,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:42:16,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:42:16,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:42:16,902 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:42:16,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i [2024-11-16 12:42:18,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:42:18,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:42:18,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i [2024-11-16 12:42:18,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0de418003/3ddd766359574084a4c0ace61248f0fb/FLAG47014d9af [2024-11-16 12:42:18,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0de418003/3ddd766359574084a4c0ace61248f0fb [2024-11-16 12:42:18,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:42:18,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:42:18,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:42:18,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:42:18,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:42:18,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b388190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18, skipping insertion in model container [2024-11-16 12:42:18,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:42:18,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i[913,926] [2024-11-16 12:42:18,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:42:18,502 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:42:18,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i[913,926] [2024-11-16 12:42:18,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:42:18,558 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:42:18,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18 WrapperNode [2024-11-16 12:42:18,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:42:18,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:42:18,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:42:18,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:42:18,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,601 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-16 12:42:18,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:42:18,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:42:18,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:42:18,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:42:18,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:42:18,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:42:18,640 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:42:18,640 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:42:18,640 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:42:18,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (1/1) ... [2024-11-16 12:42:18,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:42:18,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:42:18,677 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-16 12:42:18,680 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-16 12:42:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:42:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:42:18,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:42:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:42:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:42:18,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:42:18,778 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:42:18,780 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:42:19,004 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2024-11-16 12:42:19,035 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 12:42:19,035 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:42:19,049 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:42:19,050 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 12:42:19,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:42:19 BoogieIcfgContainer [2024-11-16 12:42:19,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:42:19,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:42:19,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:42:19,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:42:19,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:42:18" (1/3) ... [2024-11-16 12:42:19,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd1097e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:19, skipping insertion in model container [2024-11-16 12:42:19,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:18" (2/3) ... [2024-11-16 12:42:19,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd1097e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:19, skipping insertion in model container [2024-11-16 12:42:19,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:42:19" (3/3) ... [2024-11-16 12:42:19,056 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-74.i [2024-11-16 12:42:19,071 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:42:19,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:42:19,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:42:19,124 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;@11543215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:42:19,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:42:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:42:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 12:42:19,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:19,142 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:19,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:19,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 343783584, now seen corresponding path program 1 times [2024-11-16 12:42:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:42:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515741809] [2024-11-16 12:42:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:19,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:42:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:42:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:42:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:42:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:42:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:42:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:42:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:42:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:42:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:42:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:42:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:42:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:42:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:42:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:42:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:42:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:42:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:42:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:42:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:42:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:42:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 12:42:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 12:42:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:42:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:42:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515741809] [2024-11-16 12:42:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515741809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:42:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296315718] [2024-11-16 12:42:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:19,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:42:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:42:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:42:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:42:19,461 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:42:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:19,489 INFO L93 Difference]: Finished difference Result 153 states and 253 transitions. [2024-11-16 12:42:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:42:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2024-11-16 12:42:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:19,497 INFO L225 Difference]: With dead ends: 153 [2024-11-16 12:42:19,497 INFO L226 Difference]: Without dead ends: 75 [2024-11-16 12:42:19,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-16 12:42:19,502 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:19,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:42:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-16 12:42:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-16 12:42:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:42:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-11-16 12:42:19,557 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 147 [2024-11-16 12:42:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:19,578 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-11-16 12:42:19,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:42:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-11-16 12:42:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 12:42:19,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:19,588 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:19,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:42:19,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1878015386, now seen corresponding path program 1 times [2024-11-16 12:42:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:42:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566957880] [2024-11-16 12:42:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:42:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:42:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:42:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:42:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:42:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:42:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:42:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:42:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:42:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:42:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:42:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:42:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:42:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:42:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:42:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:42:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:42:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:42:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:42:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:42:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:42:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 12:42:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 12:42:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:42:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:42:19,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566957880] [2024-11-16 12:42:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566957880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:19,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:42:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675519707] [2024-11-16 12:42:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:19,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:42:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:42:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:42:19,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:42:19,850 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:19,896 INFO L93 Difference]: Finished difference Result 183 states and 263 transitions. [2024-11-16 12:42:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:42:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-16 12:42:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:19,900 INFO L225 Difference]: With dead ends: 183 [2024-11-16 12:42:19,901 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 12:42:19,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:42:19,903 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 48 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:19,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 199 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:42:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 12:42:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2024-11-16 12:42:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 75 states have internal predecessors, (93), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:42:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-11-16 12:42:19,926 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 147 [2024-11-16 12:42:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:19,927 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-11-16 12:42:19,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-11-16 12:42:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 12:42:19,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:19,930 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:42:19,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2074528891, now seen corresponding path program 1 times [2024-11-16 12:42:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:42:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598858644] [2024-11-16 12:42:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:42:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:42:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:42:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:42:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:42:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:42:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:42:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:42:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:42:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:42:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:42:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:42:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:42:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:42:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:42:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:42:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:42:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:42:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:42:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:42:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:42:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 12:42:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 12:42:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:42:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:42:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598858644] [2024-11-16 12:42:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598858644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:20,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:20,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:42:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6974566] [2024-11-16 12:42:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:20,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:42:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:42:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:42:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:42:20,576 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:20,843 INFO L93 Difference]: Finished difference Result 305 states and 435 transitions. [2024-11-16 12:42:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:42:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-16 12:42:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:20,846 INFO L225 Difference]: With dead ends: 305 [2024-11-16 12:42:20,847 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 12:42:20,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:42:20,848 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 78 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:20,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 342 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:42:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 12:42:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 155. [2024-11-16 12:42:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 99 states have internal predecessors, (117), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:42:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2024-11-16 12:42:20,879 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 147 [2024-11-16 12:42:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2024-11-16 12:42:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2024-11-16 12:42:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 12:42:20,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:20,882 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:42:20,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -140746275, now seen corresponding path program 1 times [2024-11-16 12:42:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:42:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281649581] [2024-11-16 12:42:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:42:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:42:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:42:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:42:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:42:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:42:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:42:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:42:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:42:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:42:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:42:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:42:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:42:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:42:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:42:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:42:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:42:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:42:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:42:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:42:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:42:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 12:42:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 12:42:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:42:21,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:42:21,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281649581] [2024-11-16 12:42:21,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281649581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:21,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:42:21,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247260468] [2024-11-16 12:42:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:21,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:42:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:42:21,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:42:21,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:42:21,383 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:21,670 INFO L93 Difference]: Finished difference Result 305 states and 434 transitions. [2024-11-16 12:42:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:42:21,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-16 12:42:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:21,672 INFO L225 Difference]: With dead ends: 305 [2024-11-16 12:42:21,673 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 12:42:21,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:42:21,674 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 76 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:21,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 398 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:42:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 12:42:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 156. [2024-11-16 12:42:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 100 states have internal predecessors, (118), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:42:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2024-11-16 12:42:21,700 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 148 [2024-11-16 12:42:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2024-11-16 12:42:21,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2024-11-16 12:42:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 12:42:21,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:21,702 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:21,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:42:21,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:21,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1212563422, now seen corresponding path program 1 times [2024-11-16 12:42:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:42:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000308415] [2024-11-16 12:42:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:42:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:42:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:42:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:42:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:42:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:42:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:42:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:42:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:42:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:42:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:42:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:42:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:42:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:42:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:42:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:42:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:42:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:42:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:42:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:42:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:42:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 12:42:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 12:42:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:42:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:42:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000308415] [2024-11-16 12:42:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000308415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:22,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:22,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:42:22,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874127685] [2024-11-16 12:42:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:22,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:42:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:42:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:42:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:42:22,011 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:22,085 INFO L93 Difference]: Finished difference Result 267 states and 383 transitions. [2024-11-16 12:42:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:42:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-16 12:42:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:22,087 INFO L225 Difference]: With dead ends: 267 [2024-11-16 12:42:22,087 INFO L226 Difference]: Without dead ends: 163 [2024-11-16 12:42:22,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:42:22,089 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 96 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:22,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 413 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:42:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-16 12:42:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2024-11-16 12:42:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 100 states have internal predecessors, (116), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:42:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2024-11-16 12:42:22,115 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 148 [2024-11-16 12:42:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:22,116 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2024-11-16 12:42:22,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2024-11-16 12:42:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:42:22,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:22,117 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:22,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:42:22,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1631285221, now seen corresponding path program 1 times [2024-11-16 12:42:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:42:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612327058] [2024-11-16 12:42:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:42:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:42:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:42:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:42:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:42:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:42:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:42:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:42:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:42:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:42:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:42:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:42:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:42:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:42:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:42:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:42:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:42:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:42:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:42:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:42:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:42:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 12:42:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 12:42:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-16 12:42:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:42:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612327058] [2024-11-16 12:42:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612327058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:42:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074779610] [2024-11-16 12:42:22,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:22,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:42:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:42:22,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:42:22,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:42:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:22,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 12:42:22,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:42:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 562 proven. 54 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-16 12:42:22,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:42:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-16 12:42:23,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074779610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:42:23,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:42:23,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 27 [2024-11-16 12:42:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954503965] [2024-11-16 12:42:23,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:42:23,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-16 12:42:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:42:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-16 12:42:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2024-11-16 12:42:23,736 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand has 27 states, 26 states have (on average 3.923076923076923) internal successors, (102), 27 states have internal predecessors, (102), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-11-16 12:42:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:25,140 INFO L93 Difference]: Finished difference Result 581 states and 783 transitions. [2024-11-16 12:42:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 12:42:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.923076923076923) internal successors, (102), 27 states have internal predecessors, (102), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) Word has length 150 [2024-11-16 12:42:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:25,144 INFO L225 Difference]: With dead ends: 581 [2024-11-16 12:42:25,144 INFO L226 Difference]: Without dead ends: 477 [2024-11-16 12:42:25,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2024-11-16 12:42:25,147 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 489 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:25,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 608 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 12:42:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-16 12:42:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 258. [2024-11-16 12:42:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 177 states have (on average 1.1977401129943503) internal successors, (212), 180 states have internal predecessors, (212), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 12:42:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 352 transitions. [2024-11-16 12:42:25,196 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 352 transitions. Word has length 150 [2024-11-16 12:42:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:25,197 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 352 transitions. [2024-11-16 12:42:25,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.923076923076923) internal successors, (102), 27 states have internal predecessors, (102), 7 states have call successors, (45), 3 states have call predecessors, (45), 7 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-11-16 12:42:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 352 transitions. [2024-11-16 12:42:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 12:42:25,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:25,198 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:25,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:42:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 12:42:25,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:25,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1434771716, now seen corresponding path program 1 times [2024-11-16 12:42:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:42:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908588781] [2024-11-16 12:42:25,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:42:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:42:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077626380] [2024-11-16 12:42:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:25,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:42:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:42:25,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:42:25,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:42:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:42:25,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:42:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:42:25,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:42:25,619 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:42:25,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:42:25,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 12:42:25,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-16 12:42:25,824 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:25,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:42:25,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:42:25 BoogieIcfgContainer [2024-11-16 12:42:25,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:42:25,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:42:25,904 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:42:25,904 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:42:25,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:42:19" (3/4) ... [2024-11-16 12:42:25,907 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:42:25,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:42:25,909 INFO L158 Benchmark]: Toolchain (without parser) took 7624.16ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 153.5MB in the beginning and 219.9MB in the end (delta: -66.4MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-16 12:42:25,909 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 91.6MB in the beginning and 91.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:42:25,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.07ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 137.9MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:42:25,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.63ms. Allocated memory is still 182.5MB. Free memory was 137.9MB in the beginning and 134.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:42:25,909 INFO L158 Benchmark]: Boogie Preprocessor took 37.14ms. Allocated memory is still 182.5MB. Free memory was 134.8MB in the beginning and 130.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:42:25,909 INFO L158 Benchmark]: IcfgBuilder took 410.71ms. Allocated memory is still 182.5MB. Free memory was 130.6MB in the beginning and 107.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 12:42:25,910 INFO L158 Benchmark]: TraceAbstraction took 6851.94ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 107.5MB in the beginning and 219.9MB in the end (delta: -112.4MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. [2024-11-16 12:42:25,910 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 264.2MB. Free memory is still 219.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:42:25,912 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.14ms. Allocated memory is still 130.0MB. Free memory was 91.6MB in the beginning and 91.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.07ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 137.9MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.63ms. Allocated memory is still 182.5MB. Free memory was 137.9MB in the beginning and 134.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.14ms. Allocated memory is still 182.5MB. Free memory was 134.8MB in the beginning and 130.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 410.71ms. Allocated memory is still 182.5MB. Free memory was 130.6MB in the beginning and 107.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6851.94ms. Allocated memory was 182.5MB in the beginning and 264.2MB in the end (delta: 81.8MB). Free memory was 107.5MB in the beginning and 219.9MB in the end (delta: -112.4MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 264.2MB. Free memory is still 219.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] unsigned long int last_1_var_1_1 = 64; [L43] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L132] last_1_var_1_1 = var_1_1 [L133] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET updateLastVariables() [L144] CALL updateVariables() [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L97] var_1_5 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L100] var_1_7 = __VERIFIER_nondet_ulong() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L103] var_1_9 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L109] var_1_12 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L112] var_1_13 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L115] var_1_16 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L118] var_1_17 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L120] var_1_19 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_20 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L124] var_1_21 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L125] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L126] var_1_22 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_23 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET updateVariables() [L145] CALL step() [L47] signed long int stepLocal_1 = last_1_var_1_11; [L48] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L49] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L50] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L54] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L56] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L67] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L69] COND FALSE !(! (var_1_11 >= var_1_11)) [L76] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L78] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L83] COND FALSE !(\read(var_1_10)) [L86] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L88] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L89] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136-L137] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 2067 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1400 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1342 IncrementalHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 667 mSDtfsCounter, 1342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 655 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 321 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1179 ConstructedInterpolants, 0 QuantifiedInterpolants, 3978 SizeOfPredicates, 4 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 7248/7392 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-16 12:42:25,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 482b3fdef5f1e71e1007340a4f7a341f28794f7d99258d661ab845ef474c148c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:42:27,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:42:27,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:42:27,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:42:27,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:42:27,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:42:27,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:42:27,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:42:27,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:42:27,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:42:27,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:42:27,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:42:27,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:42:27,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:42:27,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:42:27,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:42:27,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:42:27,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:42:27,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:42:27,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:42:27,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:42:27,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:42:27,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:42:27,873 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:42:27,873 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:42:27,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:42:27,874 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:42:27,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:42:27,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:42:27,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:42:27,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:42:27,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:42:27,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:42:27,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:42:27,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:42:27,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:42:27,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:42:27,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:42:27,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:42:27,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:42:27,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:42:27,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:42:27,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:42:27,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:42:27,877 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 482b3fdef5f1e71e1007340a4f7a341f28794f7d99258d661ab845ef474c148c [2024-11-16 12:42:28,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:42:28,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:42:28,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:42:28,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:42:28,159 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:42:28,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i [2024-11-16 12:42:29,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:42:29,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:42:29,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i [2024-11-16 12:42:29,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d83788d7/940c48dc5c6443fd9d9416bcd5322b5b/FLAG37873605d [2024-11-16 12:42:29,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d83788d7/940c48dc5c6443fd9d9416bcd5322b5b [2024-11-16 12:42:29,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:42:29,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:42:29,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:42:29,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:42:29,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:42:29,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ccadf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29, skipping insertion in model container [2024-11-16 12:42:29,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:42:29,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i[913,926] [2024-11-16 12:42:29,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:42:29,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:42:29,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-74.i[913,926] [2024-11-16 12:42:29,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:42:29,909 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:42:29,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29 WrapperNode [2024-11-16 12:42:29,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:42:29,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:42:29,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:42:29,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:42:29,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,953 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-16 12:42:29,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:42:29,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:42:29,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:42:29,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:42:29,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:42:29,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:29,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:42:29,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:42:29,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:42:29,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:42:30,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (1/1) ... [2024-11-16 12:42:30,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:42:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:42:30,029 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-16 12:42:30,031 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-16 12:42:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:42:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:42:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:42:30,062 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:42:30,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:42:30,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:42:30,125 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:42:30,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:42:31,292 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 12:42:31,292 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:42:31,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:42:31,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:42:31,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:42:31 BoogieIcfgContainer [2024-11-16 12:42:31,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:42:31,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:42:31,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:42:31,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:42:31,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:42:29" (1/3) ... [2024-11-16 12:42:31,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528f0a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:31, skipping insertion in model container [2024-11-16 12:42:31,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:29" (2/3) ... [2024-11-16 12:42:31,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528f0a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:31, skipping insertion in model container [2024-11-16 12:42:31,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:42:31" (3/3) ... [2024-11-16 12:42:31,311 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-74.i [2024-11-16 12:42:31,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:42:31,325 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:42:31,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:42:31,375 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;@23c6fe95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:42:31,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:42:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:42:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 12:42:31,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:31,391 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:31,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:31,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash 320037693, now seen corresponding path program 1 times [2024-11-16 12:42:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:42:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717469579] [2024-11-16 12:42:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:31,410 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-16 12:42:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:42:31,413 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-16 12:42:31,414 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-16 12:42:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:31,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:42:31,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:42:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-11-16 12:42:31,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:42:31,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:42:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717469579] [2024-11-16 12:42:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717469579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:42:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136303433] [2024-11-16 12:42:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:42:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:42:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:42:31,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:42:31,828 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:42:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:31,856 INFO L93 Difference]: Finished difference Result 133 states and 225 transitions. [2024-11-16 12:42:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:42:31,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 143 [2024-11-16 12:42:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:31,864 INFO L225 Difference]: With dead ends: 133 [2024-11-16 12:42:31,864 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 12:42:31,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-16 12:42:31,872 INFO L432 NwaCegarLoop]: 95 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, 95 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-16 12:42:31,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:42:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 12:42:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-16 12:42:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:42:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-11-16 12:42:31,909 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 143 [2024-11-16 12:42:31,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:31,909 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-11-16 12:42:31,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:42:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-11-16 12:42:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 12:42:31,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:31,912 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:31,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:42:32,113 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-16 12:42:32,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:32,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1945288701, now seen corresponding path program 1 times [2024-11-16 12:42:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:42:32,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838605449] [2024-11-16 12:42:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:32,115 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-16 12:42:32,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:42:32,117 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-16 12:42:32,118 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-16 12:42:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:32,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 12:42:32,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:42:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:42:33,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:42:33,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:42:33,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838605449] [2024-11-16 12:42:33,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838605449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:33,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:33,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:42:33,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133860783] [2024-11-16 12:42:33,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:33,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:42:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:42:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:42:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:42:33,281 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:34,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:42:36,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:42:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:36,107 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2024-11-16 12:42:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:42:36,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-11-16 12:42:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:36,128 INFO L225 Difference]: With dead ends: 191 [2024-11-16 12:42:36,128 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 12:42:36,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:42:36,129 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 57 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:36,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 297 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 12:42:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 12:42:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2024-11-16 12:42:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 12:42:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-16 12:42:36,153 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 143 [2024-11-16 12:42:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:36,155 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-16 12:42:36,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-16 12:42:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:42:36,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:36,157 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:36,170 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-16 12:42:36,358 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-16 12:42:36,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 615616140, now seen corresponding path program 1 times [2024-11-16 12:42:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:42:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766471450] [2024-11-16 12:42:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:36,360 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-16 12:42:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:42:36,362 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-16 12:42:36,363 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-16 12:42:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:36,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 12:42:36,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:42:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:42:37,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:42:37,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:42:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766471450] [2024-11-16 12:42:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766471450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:42:37,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:42:37,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:42:37,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319313050] [2024-11-16 12:42:37,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:42:37,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:42:37,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:42:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:42:37,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:42:37,321 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:38,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:42:40,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:42:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:40,416 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2024-11-16 12:42:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:42:40,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-16 12:42:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:40,437 INFO L225 Difference]: With dead ends: 191 [2024-11-16 12:42:40,437 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 12:42:40,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:42:40,439 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 55 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:40,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 298 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-16 12:42:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 12:42:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2024-11-16 12:42:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 12:42:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-16 12:42:40,457 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 144 [2024-11-16 12:42:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:40,457 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-16 12:42:40,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:42:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2024-11-16 12:42:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:42:40,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:40,459 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:40,472 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-16 12:42:40,659 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-16 12:42:40,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:40,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash 322213133, now seen corresponding path program 1 times [2024-11-16 12:42:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:42:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487465746] [2024-11-16 12:42:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:40,661 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-16 12:42:40,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:42:40,663 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-16 12:42:40,664 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-16 12:42:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:40,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:42:40,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:42:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-11-16 12:42:41,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:42:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-16 12:42:41,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:42:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487465746] [2024-11-16 12:42:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487465746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:42:41,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:42:41,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 12:42:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987450500] [2024-11-16 12:42:41,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:42:41,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:42:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:42:41,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:42:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:42:41,303 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-16 12:42:43,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:42:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:43,729 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2024-11-16 12:42:43,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:42:43,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 144 [2024-11-16 12:42:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:43,733 INFO L225 Difference]: With dead ends: 187 [2024-11-16 12:42:43,733 INFO L226 Difference]: Without dead ends: 125 [2024-11-16 12:42:43,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:42:43,734 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 89 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:43,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 143 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-16 12:42:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-16 12:42:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2024-11-16 12:42:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 12:42:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-11-16 12:42:43,753 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 144 [2024-11-16 12:42:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:43,754 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-11-16 12:42:43,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-16 12:42:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-11-16 12:42:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:42:43,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:43,759 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 12:42:43,960 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-16 12:42:43,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2065023468, now seen corresponding path program 1 times [2024-11-16 12:42:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:42:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106388156] [2024-11-16 12:42:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:43,961 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-16 12:42:43,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:42:43,963 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-16 12:42:43,964 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-16 12:42:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:44,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 12:42:44,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:42:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-16 12:42:44,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:42:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-16 12:42:45,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:42:45,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106388156] [2024-11-16 12:42:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106388156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:42:45,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:42:45,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-16 12:42:45,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270283568] [2024-11-16 12:42:45,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:42:45,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 12:42:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:42:45,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 12:42:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-16 12:42:45,118 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-16 12:42:47,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:42:48,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:42:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:42:49,087 INFO L93 Difference]: Finished difference Result 248 states and 325 transitions. [2024-11-16 12:42:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 12:42:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 144 [2024-11-16 12:42:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:42:49,090 INFO L225 Difference]: With dead ends: 248 [2024-11-16 12:42:49,090 INFO L226 Difference]: Without dead ends: 183 [2024-11-16 12:42:49,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-11-16 12:42:49,091 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 100 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-16 12:42:49,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 367 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-16 12:42:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-16 12:42:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2024-11-16 12:42:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 99 states have internal predecessors, (106), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:42:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2024-11-16 12:42:49,110 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 144 [2024-11-16 12:42:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:42:49,110 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2024-11-16 12:42:49,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-16 12:42:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2024-11-16 12:42:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:42:49,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:42:49,112 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:42:49,123 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-16 12:42:49,312 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-16 12:42:49,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:42:49,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:42:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2093652619, now seen corresponding path program 1 times [2024-11-16 12:42:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:42:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925965116] [2024-11-16 12:42:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:42:49,314 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-16 12:42:49,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:42:49,316 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-16 12:42:49,317 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-16 12:42:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:42:49,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-16 12:42:49,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:43:16,947 WARN L286 SmtUtils]: Spent 9.56s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-16 12:43:43,876 WARN L286 SmtUtils]: Spent 11.55s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)