./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-8.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_loopvsstraightlinecode_25-1loop_file-8.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 b3a6a6cd191a7724a5b623c2019c64e0a13b05c4262307132bc9d178d72aa48d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:25:59,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:25:59,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:25:59,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:25:59,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:25:59,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:25:59,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:25:59,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:25:59,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:25:59,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:25:59,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:25:59,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:25:59,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:25:59,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:25:59,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:25:59,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:25:59,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:25:59,836 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:25:59,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:25:59,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:25:59,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:25:59,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:25:59,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:25:59,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:25:59,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:25:59,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:25:59,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:25:59,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:25:59,844 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:25:59,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:25:59,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:25:59,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:25:59,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:25:59,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:25:59,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:25:59,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:25:59,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:25:59,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:25:59,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:25:59,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:25:59,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:25:59,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:25:59,848 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 -> b3a6a6cd191a7724a5b623c2019c64e0a13b05c4262307132bc9d178d72aa48d [2024-11-16 16:26:00,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:26:00,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:26:00,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:26:00,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:26:00,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:26:00,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-16 16:26:01,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:26:01,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:26:01,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-16 16:26:01,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3949b132f/aa0a17bfdf7744fbba031e65fb9c968f/FLAG655abbd73 [2024-11-16 16:26:02,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3949b132f/aa0a17bfdf7744fbba031e65fb9c968f [2024-11-16 16:26:02,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:26:02,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:26:02,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:26:02,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:26:02,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:26:02,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18002904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02, skipping insertion in model container [2024-11-16 16:26:02,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:26:02,446 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_loopvsstraightlinecode_25-1loop_file-8.i[914,927] [2024-11-16 16:26:02,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:26:02,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:26:02,507 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_loopvsstraightlinecode_25-1loop_file-8.i[914,927] [2024-11-16 16:26:02,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:26:02,543 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:26:02,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02 WrapperNode [2024-11-16 16:26:02,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:26:02,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:26:02,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:26:02,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:26:02,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,599 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-16 16:26:02,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:26:02,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:26:02,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:26:02,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:26:02,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,643 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 16:26:02,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:26:02,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:26:02,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:26:02,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:26:02,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (1/1) ... [2024-11-16 16:26:02,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:26:02,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:26:02,696 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 16:26:02,699 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 16:26:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:26:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:26:02,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:26:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:26:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:26:02,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:26:02,848 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:26:02,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:26:03,138 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-16 16:26:03,139 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:26:03,157 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:26:03,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:26:03,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:26:03 BoogieIcfgContainer [2024-11-16 16:26:03,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:26:03,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:26:03,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:26:03,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:26:03,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:26:02" (1/3) ... [2024-11-16 16:26:03,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ac30a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:26:03, skipping insertion in model container [2024-11-16 16:26:03,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:02" (2/3) ... [2024-11-16 16:26:03,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ac30a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:26:03, skipping insertion in model container [2024-11-16 16:26:03,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:26:03" (3/3) ... [2024-11-16 16:26:03,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-16 16:26:03,190 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:26:03,191 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:26:03,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:26:03,324 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;@4fbb0b56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:26:03,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:26:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:03,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:03,362 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:03,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1968753726, now seen corresponding path program 1 times [2024-11-16 16:26:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:26:03,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597661953] [2024-11-16 16:26:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:03,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:26:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:26:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:26:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:26:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:26:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:26:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:26:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:26:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:26:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:26:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:26:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:26:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:26:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:26:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:26:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:26:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:26:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:26:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 16:26:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:26:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 16:26:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 16:26:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:26:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597661953] [2024-11-16 16:26:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597661953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:26:03,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:26:03,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:26:03,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864791608] [2024-11-16 16:26:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:26:03,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:26:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:26:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:26:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:26:03,826 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:26:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:26:03,851 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-11-16 16:26:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:26:03,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-16 16:26:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:26:03,864 INFO L225 Difference]: With dead ends: 112 [2024-11-16 16:26:03,866 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 16:26:03,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 16:26:03,875 INFO L432 NwaCegarLoop]: 80 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, 80 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 16:26:03,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:26:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 16:26:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 16:26:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-16 16:26:03,927 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 127 [2024-11-16 16:26:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:26:03,928 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-16 16:26:03,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:26:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-16 16:26:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:03,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:03,931 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:03,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:26:03,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:03,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1320573212, now seen corresponding path program 1 times [2024-11-16 16:26:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:26:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028122315] [2024-11-16 16:26:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:26:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:26:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:26:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:26:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:26:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:26:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:26:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:26:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:26:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:26:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:26:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:26:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:26:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:26:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:26:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:26:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:26:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:26:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 16:26:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:26:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 16:26:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 16:26:04,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:26:04,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028122315] [2024-11-16 16:26:04,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028122315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:26:04,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:26:04,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:26:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478354443] [2024-11-16 16:26:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:26:04,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:26:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:26:04,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:26:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:26:04,403 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 16:26:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:26:04,574 INFO L93 Difference]: Finished difference Result 103 states and 149 transitions. [2024-11-16 16:26:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:26:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-16 16:26:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:26:04,579 INFO L225 Difference]: With dead ends: 103 [2024-11-16 16:26:04,581 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 16:26:04,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 16:26:04,584 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:26:04,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:26:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 16:26:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 16:26:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-16 16:26:04,604 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 127 [2024-11-16 16:26:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:26:04,606 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-16 16:26:04,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 16:26:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-16 16:26:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:04,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:04,609 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:04,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:26:04,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:04,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1517086717, now seen corresponding path program 1 times [2024-11-16 16:26:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:26:04,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157859629] [2024-11-16 16:26:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:26:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:26:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:26:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:26:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:26:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:26:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:26:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:26:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:26:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:26:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:26:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:26:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:26:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:26:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 16:26:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 16:26:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:26:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:26:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 16:26:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 16:26:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 16:26:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 16:26:05,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:26:05,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157859629] [2024-11-16 16:26:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157859629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:26:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263983280] [2024-11-16 16:26:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:26:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:26:05,053 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 16:26:05,062 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 16:26:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:05,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:26:05,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:26:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-16 16:26:05,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:26:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 16:26:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263983280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:26:05,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 16:26:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 16:26:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947107999] [2024-11-16 16:26:05,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 16:26:05,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:26:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:26:05,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:26:05,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:26:05,934 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-16 16:26:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:26:06,105 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2024-11-16 16:26:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:26:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 127 [2024-11-16 16:26:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:26:06,113 INFO L225 Difference]: With dead ends: 111 [2024-11-16 16:26:06,113 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 16:26:06,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 290 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 16:26:06,115 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:26:06,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 107 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:26:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 16:26:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-16 16:26:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-11-16 16:26:06,139 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 127 [2024-11-16 16:26:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:26:06,140 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-11-16 16:26:06,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-16 16:26:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-11-16 16:26:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:06,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:06,146 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:06,162 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 16:26:06,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:26:06,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:06,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1488457566, now seen corresponding path program 1 times [2024-11-16 16:26:06,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:26:06,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448627781] [2024-11-16 16:26:06,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:06,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:26:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:26:06,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:26:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:26:06,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:26:06,501 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:26:06,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:26:06,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:26:06,507 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 16:26:06,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:26:06,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:26:06 BoogieIcfgContainer [2024-11-16 16:26:06,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:26:06,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:26:06,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:26:06,604 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:26:06,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:26:03" (3/4) ... [2024-11-16 16:26:06,606 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:26:06,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:26:06,608 INFO L158 Benchmark]: Toolchain (without parser) took 4370.32ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 110.9MB in the beginning and 137.6MB in the end (delta: -26.6MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2024-11-16 16:26:06,608 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 130.0MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:26:06,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.13ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 96.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 16:26:06,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.16ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 93.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:26:06,609 INFO L158 Benchmark]: Boogie Preprocessor took 58.42ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 90.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:26:06,609 INFO L158 Benchmark]: IcfgBuilder took 498.80ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 73.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 16:26:06,610 INFO L158 Benchmark]: TraceAbstraction took 3443.14ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 72.9MB in the beginning and 138.6MB in the end (delta: -65.7MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-11-16 16:26:06,610 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 264.2MB. Free memory was 138.6MB in the beginning and 137.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:26:06,612 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.20ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 130.0MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.13ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 96.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.16ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 93.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.42ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 90.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 498.80ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 73.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3443.14ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 72.9MB in the beginning and 138.6MB in the end (delta: -65.7MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 264.2MB. Free memory was 138.6MB in the beginning and 137.6MB in the end (delta: 1.0MB). 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 97, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] signed char var_1_11 = 2; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 2; [L31] float var_1_14 = 31.325; [L32] float var_1_15 = 7.4; [L33] float var_1_16 = 7.375; [L34] unsigned short int var_1_17 = 256; [L35] unsigned short int var_1_19 = 24509; [L36] unsigned short int var_1_20 = 32; [L37] unsigned short int var_1_21 = 4; [L38] signed char last_1_var_1_11 = 2; VAL [isInitial=0, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L62] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L64] var_1_5 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L67] var_1_6 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_7 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L71] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L72] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L73] var_1_12 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L74] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L75] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L76] var_1_13 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L77] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L83] var_1_19 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L84] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L85] CALL assume_abort_if_not(var_1_19 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L85] RET assume_abort_if_not(var_1_19 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L86] var_1_20 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L87] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L88] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] var_1_21 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L90] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L91] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L106] RET updateVariables() [L107] CALL step() [L42] COND FALSE !(((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_14=1253/40, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L45] var_1_14 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_17=256, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L46] COND TRUE var_1_14 <= ((var_1_15 - var_1_16) * var_1_14) [L47] var_1_17 = ((var_1_19 - var_1_20) + var_1_21) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_17=0, var_1_19=-49153, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L51] COND TRUE var_1_17 >= (8u * var_1_17) [L52] var_1_1 = (! (var_1_4 || (var_1_5 || var_1_6))) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_17=0, var_1_19=-49153, var_1_1=1, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L56] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_17=0, var_1_19=-49153, var_1_1=1, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L107] RET step() [L108] CALL, EXPR property() [L97-L98] return (((((var_1_17 >= (8u * var_1_17)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed long int) (var_1_17 + var_1_11))) : 1)) && ((((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) ? (var_1_11 == ((signed char) (var_1_12 + var_1_13))) : 1)) && (var_1_14 == ((float) (var_1_15 - var_1_16)))) && ((var_1_14 <= ((var_1_15 - var_1_16) * var_1_14)) ? (var_1_17 == ((unsigned short int) ((var_1_19 - var_1_20) + var_1_21))) : (var_1_17 == ((unsigned short int) var_1_20))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_17=0, var_1_19=-49153, var_1_1=1, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_17=0, var_1_19=-49153, var_1_1=1, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=0, var_1_17=0, var_1_19=-49153, var_1_1=1, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 200 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1378 SizeOfPredicates, 1 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3656/3800 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 16:26:06,640 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_loopvsstraightlinecode_25-1loop_file-8.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 b3a6a6cd191a7724a5b623c2019c64e0a13b05c4262307132bc9d178d72aa48d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:26:08,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:26:09,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:26:09,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:26:09,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:26:09,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:26:09,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:26:09,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:26:09,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:26:09,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:26:09,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:26:09,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:26:09,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:26:09,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:26:09,086 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:26:09,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:26:09,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:26:09,087 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:26:09,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:26:09,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:26:09,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:26:09,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:26:09,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:26:09,093 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:26:09,093 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:26:09,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:26:09,094 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:26:09,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:26:09,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:26:09,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:26:09,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:26:09,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:26:09,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:26:09,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:26:09,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:26:09,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:26:09,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:26:09,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:26:09,097 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:26:09,097 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:26:09,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:26:09,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:26:09,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:26:09,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:26:09,099 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 -> b3a6a6cd191a7724a5b623c2019c64e0a13b05c4262307132bc9d178d72aa48d [2024-11-16 16:26:09,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:26:09,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:26:09,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:26:09,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:26:09,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:26:09,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-16 16:26:11,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:26:11,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:26:11,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-16 16:26:11,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d738eb1a/5434ead1fa1d432ea3a562b485bd26f3/FLAG0cfb90e6a [2024-11-16 16:26:11,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d738eb1a/5434ead1fa1d432ea3a562b485bd26f3 [2024-11-16 16:26:11,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:26:11,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:26:11,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:26:11,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:26:11,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:26:11,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:26:11" (1/1) ... [2024-11-16 16:26:11,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbe2884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:11, skipping insertion in model container [2024-11-16 16:26:11,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:26:11" (1/1) ... [2024-11-16 16:26:11,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:26:11,917 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_loopvsstraightlinecode_25-1loop_file-8.i[914,927] [2024-11-16 16:26:11,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:26:11,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:26:12,006 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_loopvsstraightlinecode_25-1loop_file-8.i[914,927] [2024-11-16 16:26:12,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:26:12,045 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:26:12,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12 WrapperNode [2024-11-16 16:26:12,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:26:12,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:26:12,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:26:12,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:26:12,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,093 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 16:26:12,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:26:12,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:26:12,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:26:12,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:26:12,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,136 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 16:26:12,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:26:12,166 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:26:12,166 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:26:12,166 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:26:12,167 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (1/1) ... [2024-11-16 16:26:12,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:26:12,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:26:12,201 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 16:26:12,208 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 16:26:12,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:26:12,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:26:12,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:26:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:26:12,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:26:12,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:26:12,324 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:26:12,326 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:26:13,606 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-16 16:26:13,606 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:26:13,623 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:26:13,623 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:26:13,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:26:13 BoogieIcfgContainer [2024-11-16 16:26:13,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:26:13,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:26:13,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:26:13,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:26:13,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:26:11" (1/3) ... [2024-11-16 16:26:13,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3954165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:26:13, skipping insertion in model container [2024-11-16 16:26:13,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:26:12" (2/3) ... [2024-11-16 16:26:13,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3954165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:26:13, skipping insertion in model container [2024-11-16 16:26:13,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:26:13" (3/3) ... [2024-11-16 16:26:13,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-16 16:26:13,653 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:26:13,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:26:13,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:26:13,723 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;@2f622f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:26:13,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:26:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:13,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:13,741 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:13,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1968753726, now seen corresponding path program 1 times [2024-11-16 16:26:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:26:13,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197091671] [2024-11-16 16:26:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:13,759 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 16:26:13,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:26:13,766 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 16:26:13,768 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 16:26:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:14,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:26:14,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:26:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-16 16:26:14,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:26:14,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:26:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197091671] [2024-11-16 16:26:14,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197091671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:26:14,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:26:14,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:26:14,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237326689] [2024-11-16 16:26:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:26:14,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:26:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:26:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:26:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:26:14,155 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:26:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:26:14,182 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-11-16 16:26:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:26:14,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 127 [2024-11-16 16:26:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:26:14,191 INFO L225 Difference]: With dead ends: 112 [2024-11-16 16:26:14,192 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 16:26:14,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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 16:26:14,199 INFO L432 NwaCegarLoop]: 80 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, 80 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 16:26:14,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:26:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 16:26:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 16:26:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-16 16:26:14,256 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 127 [2024-11-16 16:26:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:26:14,257 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-16 16:26:14,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 16:26:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-16 16:26:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:14,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:14,260 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:14,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 16:26:14,461 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 16:26:14,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:14,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1320573212, now seen corresponding path program 1 times [2024-11-16 16:26:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:26:14,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776192796] [2024-11-16 16:26:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:14,464 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 16:26:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:26:14,465 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 16:26:14,467 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 16:26:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:14,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 16:26:14,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:26:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 16:26:15,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:26:15,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:26:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776192796] [2024-11-16 16:26:15,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776192796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:26:15,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:26:15,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:26:15,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662634107] [2024-11-16 16:26:15,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:26:15,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:26:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:26:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:26:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:26:15,203 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 16:26:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:26:15,540 INFO L93 Difference]: Finished difference Result 103 states and 149 transitions. [2024-11-16 16:26:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:26:15,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-11-16 16:26:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:26:15,554 INFO L225 Difference]: With dead ends: 103 [2024-11-16 16:26:15,554 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 16:26:15,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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 16:26:15,556 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:26:15,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:26:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 16:26:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 16:26:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-16 16:26:15,571 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 127 [2024-11-16 16:26:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:26:15,573 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-16 16:26:15,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 16:26:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-16 16:26:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:15,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:15,575 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:15,585 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 16:26:15,779 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 16:26:15,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:15,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1517086717, now seen corresponding path program 1 times [2024-11-16 16:26:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:26:15,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635005835] [2024-11-16 16:26:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:15,782 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 16:26:15,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:26:15,788 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 16:26:15,789 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 16:26:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:16,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 16:26:16,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:26:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-16 16:26:16,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:26:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 16:26:16,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:26:16,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635005835] [2024-11-16 16:26:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635005835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:26:16,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 16:26:16,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 16:26:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327123165] [2024-11-16 16:26:16,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 16:26:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:26:16,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:26:16,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:26:16,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:26:16,543 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-16 16:26:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:26:17,106 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2024-11-16 16:26:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:26:17,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 127 [2024-11-16 16:26:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:26:17,122 INFO L225 Difference]: With dead ends: 111 [2024-11-16 16:26:17,122 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 16:26:17,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 246 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 16:26:17,127 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 16:26:17,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 106 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 16:26:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 16:26:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-16 16:26:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 16:26:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-11-16 16:26:17,151 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 127 [2024-11-16 16:26:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:26:17,152 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-11-16 16:26:17,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-16 16:26:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-11-16 16:26:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:26:17,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:26:17,154 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:26:17,165 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 (4)] Ended with exit code 0 [2024-11-16 16:26:17,355 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 16:26:17,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:26:17,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:26:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1488457566, now seen corresponding path program 1 times [2024-11-16 16:26:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:26:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030753361] [2024-11-16 16:26:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:26:17,357 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 16:26:17,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:26:17,360 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 16:26:17,361 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 16:26:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:26:17,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 16:26:17,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:26:52,564 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-16 16:27:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 258 proven. 135 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2024-11-16 16:27:12,406 INFO L311 TraceCheckSpWp]: Computing backward predicates...