./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 023d838f 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-023d838-m [2024-11-10 07:29:24,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:29:24,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:29:24,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:29:24,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:29:24,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:29:24,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:29:24,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:29:24,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:29:24,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:29:24,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:29:24,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:29:24,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:29:24,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:29:24,683 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:29:24,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:29:24,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:29:24,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:29:24,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:29:24,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:29:24,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:29:24,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:29:24,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:29:24,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:29:24,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:29:24,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:29:24,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:29:24,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:29:24,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:29:24,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:29:24,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:29:24,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:29:24,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:24,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:29:24,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:29:24,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:29:24,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:29:24,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:29:24,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:29:24,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:29:24,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:29:24,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:29:24,696 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-10 07:29:24,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:29:24,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:29:24,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:29:24,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:29:24,992 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:29:24,993 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-10 07:29:26,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:29:26,621 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:29:26,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-10 07:29:26,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32cb0cd49/7c01b207ce6e4cdbbdb86d7874ed9515/FLAG64c77f4c5 [2024-11-10 07:29:26,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32cb0cd49/7c01b207ce6e4cdbbdb86d7874ed9515 [2024-11-10 07:29:26,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:29:26,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:29:26,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:26,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:29:26,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:29:26,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:26" (1/1) ... [2024-11-10 07:29:26,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3693026e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:26, skipping insertion in model container [2024-11-10 07:29:26,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:26" (1/1) ... [2024-11-10 07:29:26,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:29:26,869 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-10 07:29:26,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:26,942 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:29:26,955 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-10 07:29:26,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:27,011 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:29:27,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27 WrapperNode [2024-11-10 07:29:27,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:27,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:27,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:29:27,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:29:27,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,071 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-10 07:29:27,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:27,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:29:27,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:29:27,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:29:27,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,099 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-10 07:29:27,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:29:27,126 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:29:27,126 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:29:27,126 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:29:27,127 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (1/1) ... [2024-11-10 07:29:27,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:27,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:29:27,169 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-10 07:29:27,175 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-10 07:29:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:29:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:29:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:29:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:29:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:29:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:29:27,314 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:29:27,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:29:27,711 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-10 07:29:27,714 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:29:27,738 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:29:27,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:29:27,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:27 BoogieIcfgContainer [2024-11-10 07:29:27,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:29:27,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:29:27,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:29:27,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:29:27,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:29:26" (1/3) ... [2024-11-10 07:29:27,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147528e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:27, skipping insertion in model container [2024-11-10 07:29:27,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:27" (2/3) ... [2024-11-10 07:29:27,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147528e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:27, skipping insertion in model container [2024-11-10 07:29:27,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:27" (3/3) ... [2024-11-10 07:29:27,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-10 07:29:27,773 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:29:27,773 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:29:27,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:29:27,870 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;@559d0f6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:29:27,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:29:27,878 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-10 07:29:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:27,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:27,895 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-10 07:29:27,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1968753726, now seen corresponding path program 1 times [2024-11-10 07:29:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:29:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076600198] [2024-11-10 07:29:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:27,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:29:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:29:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:29:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:29:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:29:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:29:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:29:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:29:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:29:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:29:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:29:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:29:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:29:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:29:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:29:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:29:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:29:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:29:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:29:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:29:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:29:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,323 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-10 07:29:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:29:28,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076600198] [2024-11-10 07:29:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076600198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:29:28,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:29:28,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:29:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152969968] [2024-11-10 07:29:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:29:28,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:29:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:29:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:29:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:29:28,360 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-10 07:29:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:28,396 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-11-10 07:29:28,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:29:28,399 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-10 07:29:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:28,408 INFO L225 Difference]: With dead ends: 112 [2024-11-10 07:29:28,408 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 07:29:28,412 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-10 07:29:28,416 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-10 07:29:28,417 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-10 07:29:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 07:29:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 07:29:28,464 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-10 07:29:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-10 07:29:28,468 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 127 [2024-11-10 07:29:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:28,469 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-10 07:29:28,469 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-10 07:29:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-10 07:29:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:28,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:28,473 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-10 07:29:28,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:29:28,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1320573212, now seen corresponding path program 1 times [2024-11-10 07:29:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:29:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715372005] [2024-11-10 07:29:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:29:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:29:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:29:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:29:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:29:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:29:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:29:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:29:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:29:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:29:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:29:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:29:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:29:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:29:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:29:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:29:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:29:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:29:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:29:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:29:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:29:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:28,971 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-10 07:29:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:29:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715372005] [2024-11-10 07:29:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715372005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:29:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:29:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:29:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236808233] [2024-11-10 07:29:28,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:29:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:29:28,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:29:28,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:29:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:29:28,979 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-10 07:29:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:29,140 INFO L93 Difference]: Finished difference Result 103 states and 149 transitions. [2024-11-10 07:29:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:29:29,141 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-10 07:29:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:29,144 INFO L225 Difference]: With dead ends: 103 [2024-11-10 07:29:29,144 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 07:29:29,145 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-10 07:29:29,146 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-10 07:29:29,147 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-10 07:29:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 07:29:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 07:29:29,164 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-10 07:29:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-10 07:29:29,170 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 127 [2024-11-10 07:29:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:29,174 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-10 07:29:29,174 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-10 07:29:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-10 07:29:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:29,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:29,177 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-10 07:29:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:29:29,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1517086717, now seen corresponding path program 1 times [2024-11-10 07:29:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:29:29,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579882408] [2024-11-10 07:29:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:29:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:29:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:29:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:29:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:29:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:29:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:29:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:29:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:29:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:29:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:29:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:29:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:29:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:29:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:29:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:29:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:29:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:29:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:29:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:29:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:29:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,701 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-10 07:29:29,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:29:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579882408] [2024-11-10 07:29:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579882408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:29:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501719794] [2024-11-10 07:29:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:29,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:29:29,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:29:29,706 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-10 07:29:29,709 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-10 07:29:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:29,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:29:29,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:29:30,200 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-10 07:29:30,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:29:30,465 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-10 07:29:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501719794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:29:30,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:29:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:29:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122728831] [2024-11-10 07:29:30,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:29:30,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:29:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:29:30,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:29:30,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:29:30,471 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-10 07:29:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:30,661 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2024-11-10 07:29:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:29:30,662 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-10 07:29:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:30,667 INFO L225 Difference]: With dead ends: 111 [2024-11-10 07:29:30,667 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 07:29:30,668 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-10 07:29:30,671 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-10 07:29:30,671 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-10 07:29:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 07:29:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-10 07:29:30,688 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-10 07:29:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-11-10 07:29:30,693 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 127 [2024-11-10 07:29:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:30,694 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-11-10 07:29:30,694 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-10 07:29:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-11-10 07:29:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:30,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:30,696 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-10 07:29:30,714 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-10 07:29:30,900 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-10 07:29:30,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:30,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1488457566, now seen corresponding path program 1 times [2024-11-10 07:29:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:29:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905943414] [2024-11-10 07:29:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:29:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:29:30,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:29:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:29:31,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:29:31,058 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:29:31,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:29:31,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:29:31,066 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 07:29:31,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:29:31,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:29:31 BoogieIcfgContainer [2024-11-10 07:29:31,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:29:31,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:29:31,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:29:31,166 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:29:31,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:27" (3/4) ... [2024-11-10 07:29:31,169 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:29:31,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:29:31,170 INFO L158 Benchmark]: Toolchain (without parser) took 4520.71ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 103.0MB in the beginning and 132.4MB in the end (delta: -29.4MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-10 07:29:31,171 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:29:31,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.86ms. Allocated memory is still 157.3MB. Free memory was 103.0MB in the beginning and 87.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:29:31,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.02ms. Allocated memory is still 157.3MB. Free memory was 87.9MB in the beginning and 85.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:29:31,174 INFO L158 Benchmark]: Boogie Preprocessor took 52.62ms. Allocated memory is still 157.3MB. Free memory was 85.5MB in the beginning and 82.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:29:31,175 INFO L158 Benchmark]: IcfgBuilder took 613.06ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 123.4MB in the end (delta: -41.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-10 07:29:31,175 INFO L158 Benchmark]: TraceAbstraction took 3422.53ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 122.6MB in the beginning and 133.4MB in the end (delta: -10.8MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2024-11-10 07:29:31,177 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 241.2MB. Free memory was 133.4MB in the beginning and 132.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:29:31,179 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 157.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.86ms. Allocated memory is still 157.3MB. Free memory was 103.0MB in the beginning and 87.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.02ms. Allocated memory is still 157.3MB. Free memory was 87.9MB in the beginning and 85.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.62ms. Allocated memory is still 157.3MB. Free memory was 85.5MB in the beginning and 82.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 613.06ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 123.4MB in the end (delta: -41.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3422.53ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 122.6MB in the beginning and 133.4MB in the end (delta: -10.8MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 241.2MB. Free memory was 133.4MB in the beginning and 132.4MB 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.7s 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-10 07:29:31,216 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-023d838-m [2024-11-10 07:29:33,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:29:33,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:29:33,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:29:33,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:29:33,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:29:33,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:29:33,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:29:33,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:29:33,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:29:33,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:29:33,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:29:33,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:29:33,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:29:33,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:29:33,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:29:33,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:29:33,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:29:33,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:29:33,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:29:33,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:29:33,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:29:33,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:29:33,768 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:29:33,769 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:29:33,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:29:33,769 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:29:33,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:29:33,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:29:33,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:29:33,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:29:33,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:29:33,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:29:33,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:29:33,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:33,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:29:33,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:29:33,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:29:33,773 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:29:33,773 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:29:33,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:29:33,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:29:33,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:29:33,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:29:33,774 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-10 07:29:34,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:29:34,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:29:34,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:29:34,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:29:34,160 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:29:34,161 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-10 07:29:35,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:29:35,943 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:29:35,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-10 07:29:35,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6fba5eae/7ea2770f4fbe4dd68c734c5539912b79/FLAGe9b20b57c [2024-11-10 07:29:35,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6fba5eae/7ea2770f4fbe4dd68c734c5539912b79 [2024-11-10 07:29:35,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:29:35,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:29:35,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:35,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:29:35,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:29:35,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:35" (1/1) ... [2024-11-10 07:29:35,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5693e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:35, skipping insertion in model container [2024-11-10 07:29:35,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:35" (1/1) ... [2024-11-10 07:29:36,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:29:36,258 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-10 07:29:36,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:36,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:29:36,366 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-10 07:29:36,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:36,413 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:29:36,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36 WrapperNode [2024-11-10 07:29:36,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:36,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:36,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:29:36,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:29:36,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,469 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-10 07:29:36,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:36,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:29:36,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:29:36,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:29:36,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,517 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-10 07:29:36,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:29:36,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:29:36,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:29:36,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:29:36,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (1/1) ... [2024-11-10 07:29:36,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:36,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:29:36,589 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-10 07:29:36,592 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-10 07:29:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:29:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:29:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:29:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:29:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:29:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:29:36,746 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:29:36,749 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:29:38,153 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-10 07:29:38,153 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:29:38,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:29:38,175 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:29:38,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:38 BoogieIcfgContainer [2024-11-10 07:29:38,177 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:29:38,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:29:38,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:29:38,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:29:38,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:29:35" (1/3) ... [2024-11-10 07:29:38,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d48d5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:38, skipping insertion in model container [2024-11-10 07:29:38,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:36" (2/3) ... [2024-11-10 07:29:38,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d48d5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:38, skipping insertion in model container [2024-11-10 07:29:38,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:38" (3/3) ... [2024-11-10 07:29:38,191 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-8.i [2024-11-10 07:29:38,212 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:29:38,212 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:29:38,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:29:38,283 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;@30a644ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:29:38,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:29:38,289 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-10 07:29:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:38,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:38,307 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-10 07:29:38,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1968753726, now seen corresponding path program 1 times [2024-11-10 07:29:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:29:38,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729143379] [2024-11-10 07:29:38,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:38,334 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-10 07:29:38,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:29:38,340 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-10 07:29:38,342 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-10 07:29:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:38,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:29:38,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:29:38,703 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-10 07:29:38,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:29:38,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:29:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729143379] [2024-11-10 07:29:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729143379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:29:38,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:29:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:29:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195305928] [2024-11-10 07:29:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:29:38,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:29:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:29:38,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:29:38,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:29:38,749 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-10 07:29:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:38,772 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-11-10 07:29:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:29:38,775 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-10 07:29:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:38,784 INFO L225 Difference]: With dead ends: 112 [2024-11-10 07:29:38,784 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 07:29:38,789 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-10 07:29:38,795 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-10 07:29:38,796 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-10 07:29:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 07:29:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 07:29:38,853 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-10 07:29:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-10 07:29:38,857 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 127 [2024-11-10 07:29:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:38,858 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-10 07:29:38,858 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-10 07:29:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-10 07:29:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:38,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:38,862 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-10 07:29:38,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:29:39,062 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-10 07:29:39,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:39,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1320573212, now seen corresponding path program 1 times [2024-11-10 07:29:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:29:39,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687252645] [2024-11-10 07:29:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:39,066 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-10 07:29:39,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:29:39,068 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-10 07:29:39,070 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-10 07:29:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:39,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 07:29:39,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:29:39,738 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-10 07:29:39,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:29:39,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:29:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687252645] [2024-11-10 07:29:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687252645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:29:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:29:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:29:39,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704924233] [2024-11-10 07:29:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:29:39,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:29:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:29:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:29:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:29:39,745 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-10 07:29:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:40,117 INFO L93 Difference]: Finished difference Result 103 states and 149 transitions. [2024-11-10 07:29:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:29:40,132 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-10 07:29:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:40,139 INFO L225 Difference]: With dead ends: 103 [2024-11-10 07:29:40,139 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 07:29:40,140 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-10 07:29:40,141 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-10 07:29:40,141 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-10 07:29:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 07:29:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 07:29:40,154 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-10 07:29:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-10 07:29:40,156 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 127 [2024-11-10 07:29:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:40,158 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-10 07:29:40,158 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-10 07:29:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-10 07:29:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:40,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:40,161 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-10 07:29:40,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 07:29:40,362 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-10 07:29:40,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:40,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1517086717, now seen corresponding path program 1 times [2024-11-10 07:29:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:29:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213350162] [2024-11-10 07:29:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:40,365 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-10 07:29:40,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:29:40,369 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-10 07:29:40,370 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-10 07:29:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:40,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:29:40,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:29:40,838 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-10 07:29:40,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:29:41,077 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-10 07:29:41,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:29:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213350162] [2024-11-10 07:29:41,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213350162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:29:41,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:29:41,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 07:29:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463691747] [2024-11-10 07:29:41,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:29:41,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:29:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:29:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:29:41,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:29:41,081 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-10 07:29:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:41,798 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2024-11-10 07:29:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:29:41,816 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-10 07:29:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:41,818 INFO L225 Difference]: With dead ends: 111 [2024-11-10 07:29:41,818 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 07:29:41,819 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-10 07:29:41,820 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:29:41,822 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.7s Time] [2024-11-10 07:29:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 07:29:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-10 07:29:41,836 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-10 07:29:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-11-10 07:29:41,838 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 127 [2024-11-10 07:29:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:41,839 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-11-10 07:29:41,839 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-10 07:29:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-11-10 07:29:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 07:29:41,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:41,841 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-10 07:29:41,853 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-10 07:29:42,042 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-10 07:29:42,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1488457566, now seen corresponding path program 1 times [2024-11-10 07:29:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:29:42,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155087943] [2024-11-10 07:29:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:42,044 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-10 07:29:42,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:29:42,048 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-10 07:29:42,049 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-10 07:29:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:42,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 07:29:42,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:30:35,626 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-10 07:30:35,627 INFO L311 TraceCheckSpWp]: Computing backward predicates...