./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.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 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:47:59,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:47:59,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:47:59,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:47:59,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:47:59,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:47:59,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:47:59,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:47:59,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:47:59,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:47:59,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:47:59,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:47:59,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:47:59,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:47:59,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:47:59,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:47:59,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:47:59,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:47:59,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:47:59,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:47:59,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:47:59,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:47:59,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:47:59,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:47:59,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:47:59,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:47:59,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:47:59,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:47:59,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:47:59,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:47:59,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:47:59,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:47:59,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:47:59,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:47:59,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:47:59,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:47:59,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:47:59,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:47:59,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:47:59,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:47:59,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:47:59,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:47:59,117 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 -> 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 [2024-11-16 15:47:59,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:47:59,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:47:59,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:47:59,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:47:59,353 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:47:59,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-16 15:48:00,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:48:00,848 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:48:00,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-16 15:48:00,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829c043fc/166d5dae761a4b38bddcee71cc4186fe/FLAG7151a9a97 [2024-11-16 15:48:01,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/829c043fc/166d5dae761a4b38bddcee71cc4186fe [2024-11-16 15:48:01,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:48:01,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:48:01,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:48:01,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:48:01,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:48:01,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a418f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01, skipping insertion in model container [2024-11-16 15:48:01,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:48:01,456 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-16 15:48:01,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:48:01,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:48:01,556 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-16 15:48:01,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:48:01,609 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:48:01,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01 WrapperNode [2024-11-16 15:48:01,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:48:01,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:48:01,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:48:01,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:48:01,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,654 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-16 15:48:01,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:48:01,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:48:01,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:48:01,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:48:01,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,692 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:48:01,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:48:01,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:48:01,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:48:01,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:48:01,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (1/1) ... [2024-11-16 15:48:01,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:48:01,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:48:01,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:48:01,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:48:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:48:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:48:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:48:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:48:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:48:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:48:01,869 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:48:01,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:48:02,042 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2024-11-16 15:48:02,064 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:48:02,065 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:48:02,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:48:02,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:48:02,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:02 BoogieIcfgContainer [2024-11-16 15:48:02,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:48:02,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:48:02,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:48:02,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:48:02,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:48:01" (1/3) ... [2024-11-16 15:48:02,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b851ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:02, skipping insertion in model container [2024-11-16 15:48:02,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:01" (2/3) ... [2024-11-16 15:48:02,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b851ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:02, skipping insertion in model container [2024-11-16 15:48:02,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:02" (3/3) ... [2024-11-16 15:48:02,091 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-16 15:48:02,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:48:02,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:48:02,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:48:02,158 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;@4e3cf9ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:48:02,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:48:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:48:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 15:48:02,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:02,172 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:02,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:02,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1289381256, now seen corresponding path program 1 times [2024-11-16 15:48:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:02,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539814574] [2024-11-16 15:48:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539814574] [2024-11-16 15:48:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539814574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:02,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:02,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:48:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558821811] [2024-11-16 15:48:02,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:02,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:48:02,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:48:02,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:48:02,535 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:02,567 INFO L93 Difference]: Finished difference Result 118 states and 193 transitions. [2024-11-16 15:48:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:48:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-11-16 15:48:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:02,579 INFO L225 Difference]: With dead ends: 118 [2024-11-16 15:48:02,580 INFO L226 Difference]: Without dead ends: 58 [2024-11-16 15:48:02,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:48:02,586 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:02,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:48:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-16 15:48:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-16 15:48:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:48:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2024-11-16 15:48:02,665 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 118 [2024-11-16 15:48:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:02,666 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2024-11-16 15:48:02,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2024-11-16 15:48:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 15:48:02,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:02,673 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:02,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:48:02,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:02,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2080652520, now seen corresponding path program 1 times [2024-11-16 15:48:02,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:02,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457713057] [2024-11-16 15:48:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457713057] [2024-11-16 15:48:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457713057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 15:48:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786258990] [2024-11-16 15:48:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:04,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 15:48:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:04,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 15:48:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:48:04,006 INFO L87 Difference]: Start difference. First operand 58 states and 81 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:04,413 INFO L93 Difference]: Finished difference Result 194 states and 261 transitions. [2024-11-16 15:48:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 15:48:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 15:48:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:04,415 INFO L225 Difference]: With dead ends: 194 [2024-11-16 15:48:04,415 INFO L226 Difference]: Without dead ends: 139 [2024-11-16 15:48:04,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:48:04,417 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 138 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:04,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 522 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:48:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-16 15:48:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2024-11-16 15:48:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 73 states have internal predecessors, (87), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:48:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2024-11-16 15:48:04,432 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 118 [2024-11-16 15:48:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2024-11-16 15:48:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2024-11-16 15:48:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 15:48:04,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:04,434 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:04,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:48:04,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:04,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 417363417, now seen corresponding path program 1 times [2024-11-16 15:48:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074038563] [2024-11-16 15:48:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:04,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074038563] [2024-11-16 15:48:04,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074038563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:04,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 15:48:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647230231] [2024-11-16 15:48:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:04,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 15:48:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 15:48:04,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:48:04,855 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:05,108 INFO L93 Difference]: Finished difference Result 239 states and 322 transitions. [2024-11-16 15:48:05,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 15:48:05,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 15:48:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:05,109 INFO L225 Difference]: With dead ends: 239 [2024-11-16 15:48:05,110 INFO L226 Difference]: Without dead ends: 139 [2024-11-16 15:48:05,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:48:05,111 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 122 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:05,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 640 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:48:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-16 15:48:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 96. [2024-11-16 15:48:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:48:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-11-16 15:48:05,122 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 118 [2024-11-16 15:48:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:05,122 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-11-16 15:48:05,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-11-16 15:48:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 15:48:05,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:05,124 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:05,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:48:05,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:05,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1920911769, now seen corresponding path program 1 times [2024-11-16 15:48:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:05,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485479512] [2024-11-16 15:48:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:05,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485479512] [2024-11-16 15:48:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485479512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:05,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:48:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98979385] [2024-11-16 15:48:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:05,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:48:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:05,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:48:05,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:48:05,249 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:05,297 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2024-11-16 15:48:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:48:05,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-16 15:48:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:05,302 INFO L225 Difference]: With dead ends: 208 [2024-11-16 15:48:05,303 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 15:48:05,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:48:05,304 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 41 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:05,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 230 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:48:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 15:48:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-11-16 15:48:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 75 states have internal predecessors, (83), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 15:48:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2024-11-16 15:48:05,315 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 118 [2024-11-16 15:48:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:05,315 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2024-11-16 15:48:05,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2024-11-16 15:48:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 15:48:05,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:05,317 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:48:05,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2099111002, now seen corresponding path program 1 times [2024-11-16 15:48:05,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994309246] [2024-11-16 15:48:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994309246] [2024-11-16 15:48:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994309246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:06,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:06,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 15:48:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780860701] [2024-11-16 15:48:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:06,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 15:48:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 15:48:06,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:48:06,247 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:06,746 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2024-11-16 15:48:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 15:48:06,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-11-16 15:48:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:06,748 INFO L225 Difference]: With dead ends: 154 [2024-11-16 15:48:06,748 INFO L226 Difference]: Without dead ends: 151 [2024-11-16 15:48:06,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 15:48:06,749 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 150 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:06,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 373 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:48:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-16 15:48:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2024-11-16 15:48:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 15:48:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2024-11-16 15:48:06,771 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 120 [2024-11-16 15:48:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:06,772 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2024-11-16 15:48:06,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2024-11-16 15:48:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 15:48:06,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:06,777 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:06,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:48:06,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1902597497, now seen corresponding path program 1 times [2024-11-16 15:48:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239510908] [2024-11-16 15:48:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:07,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239510908] [2024-11-16 15:48:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239510908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:07,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 15:48:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334225339] [2024-11-16 15:48:07,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:07,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 15:48:07,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:07,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 15:48:07,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:48:07,366 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:07,810 INFO L93 Difference]: Finished difference Result 161 states and 205 transitions. [2024-11-16 15:48:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 15:48:07,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-11-16 15:48:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:07,811 INFO L225 Difference]: With dead ends: 161 [2024-11-16 15:48:07,812 INFO L226 Difference]: Without dead ends: 158 [2024-11-16 15:48:07,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 15:48:07,813 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:07,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 479 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:48:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-16 15:48:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2024-11-16 15:48:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 15:48:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2024-11-16 15:48:07,836 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 120 [2024-11-16 15:48:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:07,836 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2024-11-16 15:48:07,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2024-11-16 15:48:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 15:48:07,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:07,838 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:48:07,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1503076607, now seen corresponding path program 1 times [2024-11-16 15:48:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313006363] [2024-11-16 15:48:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:08,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313006363] [2024-11-16 15:48:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313006363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:08,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:48:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863335796] [2024-11-16 15:48:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:48:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:48:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:48:08,222 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:08,448 INFO L93 Difference]: Finished difference Result 267 states and 342 transitions. [2024-11-16 15:48:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:48:08,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-16 15:48:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:08,451 INFO L225 Difference]: With dead ends: 267 [2024-11-16 15:48:08,451 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 15:48:08,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:48:08,452 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 100 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:08,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 512 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:48:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 15:48:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2024-11-16 15:48:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 97 states have internal predecessors, (108), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 15:48:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2024-11-16 15:48:08,468 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 120 [2024-11-16 15:48:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:08,469 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2024-11-16 15:48:08,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2024-11-16 15:48:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 15:48:08,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:08,470 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:08,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 15:48:08,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:08,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:08,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1209673600, now seen corresponding path program 1 times [2024-11-16 15:48:08,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031214639] [2024-11-16 15:48:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031214639] [2024-11-16 15:48:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031214639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:08,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:08,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 15:48:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018560628] [2024-11-16 15:48:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:08,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 15:48:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 15:48:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:48:08,671 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:08,858 INFO L93 Difference]: Finished difference Result 274 states and 349 transitions. [2024-11-16 15:48:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:48:08,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-16 15:48:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:08,862 INFO L225 Difference]: With dead ends: 274 [2024-11-16 15:48:08,862 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 15:48:08,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 15:48:08,863 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:08,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 704 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:48:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 15:48:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2024-11-16 15:48:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.125) internal successors, (99), 90 states have internal predecessors, (99), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 15:48:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2024-11-16 15:48:08,878 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 120 [2024-11-16 15:48:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:08,878 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2024-11-16 15:48:08,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2024-11-16 15:48:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 15:48:08,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:08,879 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:08,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 15:48:08,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:08,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 145720960, now seen corresponding path program 1 times [2024-11-16 15:48:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:08,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067065417] [2024-11-16 15:48:08,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067065417] [2024-11-16 15:48:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067065417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:08,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:48:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98822038] [2024-11-16 15:48:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:08,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:48:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:48:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:48:08,950 INFO L87 Difference]: Start difference. First operand 128 states and 167 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:08,990 INFO L93 Difference]: Finished difference Result 267 states and 342 transitions. [2024-11-16 15:48:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:48:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-16 15:48:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:08,991 INFO L225 Difference]: With dead ends: 267 [2024-11-16 15:48:08,992 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 15:48:08,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:48:08,992 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:08,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:48:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 15:48:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2024-11-16 15:48:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 106 states have internal predecessors, (113), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 15:48:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 193 transitions. [2024-11-16 15:48:09,014 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 193 transitions. Word has length 122 [2024-11-16 15:48:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:09,015 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 193 transitions. [2024-11-16 15:48:09,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 193 transitions. [2024-11-16 15:48:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 15:48:09,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:09,016 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 15:48:09,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 513118529, now seen corresponding path program 1 times [2024-11-16 15:48:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996996605] [2024-11-16 15:48:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:48:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:48:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:48:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:48:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:48:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:48:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:48:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:48:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:48:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:48:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:48:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:48:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:48:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:48:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:48:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:48:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:48:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:48:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 15:48:09,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:48:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996996605] [2024-11-16 15:48:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996996605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:09,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:09,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:48:09,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327605247] [2024-11-16 15:48:09,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:09,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:48:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:48:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:48:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:48:09,068 INFO L87 Difference]: Start difference. First operand 152 states and 193 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:09,110 INFO L93 Difference]: Finished difference Result 291 states and 367 transitions. [2024-11-16 15:48:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:48:09,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-16 15:48:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:09,113 INFO L225 Difference]: With dead ends: 291 [2024-11-16 15:48:09,113 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 15:48:09,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:48:09,114 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:09,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 154 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:48:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 15:48:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 136. [2024-11-16 15:48:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 96 states have internal predecessors, (103), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 15:48:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 171 transitions. [2024-11-16 15:48:09,128 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 171 transitions. Word has length 122 [2024-11-16 15:48:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:09,129 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 171 transitions. [2024-11-16 15:48:09,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 15:48:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 171 transitions. [2024-11-16 15:48:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 15:48:09,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:09,130 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:09,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 15:48:09,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 205996519, now seen corresponding path program 1 times [2024-11-16 15:48:09,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:48:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762022972] [2024-11-16 15:48:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:48:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:48:09,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:48:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:48:09,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:48:09,204 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:48:09,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:48:09,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 15:48:09,209 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:09,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:48:09,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:48:09 BoogieIcfgContainer [2024-11-16 15:48:09,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:48:09,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:48:09,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:48:09,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:48:09,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:02" (3/4) ... [2024-11-16 15:48:09,277 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:48:09,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:48:09,278 INFO L158 Benchmark]: Toolchain (without parser) took 8041.57ms. Allocated memory was 195.0MB in the beginning and 369.1MB in the end (delta: 174.1MB). Free memory was 141.2MB in the beginning and 202.7MB in the end (delta: -61.4MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2024-11-16 15:48:09,278 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:48:09,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.06ms. Allocated memory is still 195.0MB. Free memory was 141.2MB in the beginning and 160.0MB in the end (delta: -18.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 15:48:09,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.80ms. Allocated memory is still 195.0MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:48:09,279 INFO L158 Benchmark]: Boogie Preprocessor took 54.48ms. Allocated memory is still 195.0MB. Free memory was 157.9MB in the beginning and 155.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:48:09,279 INFO L158 Benchmark]: IcfgBuilder took 366.64ms. Allocated memory is still 195.0MB. Free memory was 155.2MB in the beginning and 137.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 15:48:09,280 INFO L158 Benchmark]: TraceAbstraction took 7191.44ms. Allocated memory was 195.0MB in the beginning and 369.1MB in the end (delta: 174.1MB). Free memory was 136.9MB in the beginning and 202.7MB in the end (delta: -65.7MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2024-11-16 15:48:09,280 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 369.1MB. Free memory is still 202.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:48:09,281 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.15ms. Allocated memory is still 107.0MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.06ms. Allocated memory is still 195.0MB. Free memory was 141.2MB in the beginning and 160.0MB in the end (delta: -18.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.80ms. Allocated memory is still 195.0MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.48ms. Allocated memory is still 195.0MB. Free memory was 157.9MB in the beginning and 155.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 366.64ms. Allocated memory is still 195.0MB. Free memory was 155.2MB in the beginning and 137.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7191.44ms. Allocated memory was 195.0MB in the beginning and 369.1MB in the end (delta: 174.1MB). Free memory was 136.9MB in the beginning and 202.7MB in the end (delta: -65.7MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 369.1MB. Free memory is still 202.7MB. 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 bitwiseOr at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] signed long int var_1_2 = 63; [L24] signed long int var_1_3 = 255; [L25] signed char var_1_5 = 10; [L26] signed char var_1_6 = 4; [L27] signed char var_1_7 = -10; [L28] signed long int var_1_8 = 4; [L29] signed long int var_1_9 = 99; [L30] signed long int var_1_10 = 255; [L31] signed long int var_1_11 = 24; [L32] signed long int var_1_12 = -2; [L33] signed long int var_1_13 = 1629954775; [L34] signed long int var_1_15 = 1928642731; [L35] signed short int var_1_18 = 0; [L36] unsigned short int var_1_19 = 5; VAL [isInitial=0, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=63, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L63] var_1_3 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L66] var_1_5 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L67] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L68] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L68] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L69] var_1_6 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-10, var_1_8=4, var_1_9=99] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-10, var_1_8=4, var_1_9=99] [L71] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-10, var_1_8=4, var_1_9=99] [L71] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-10, var_1_8=4, var_1_9=99] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=99] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=99] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=99] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=99] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L76] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L78] var_1_10 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L79] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L80] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L80] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L81] var_1_13 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L82] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L83] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L83] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L84] var_1_15 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L85] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L86] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L86] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L99] RET updateVariables() [L100] CALL step() [L40] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L41] COND TRUE stepLocal_0 < var_1_6 [L42] var_1_8 = ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, var_1_10=4, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L44] var_1_11 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) [L45] var_1_18 = var_1_5 [L46] var_1_19 = var_1_6 VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=1, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L47] COND TRUE (var_1_2 - var_1_3) <= (- var_1_8) [L48] var_1_1 = (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L52] EXPR var_1_6 | 5 VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-2, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L52] signed long int stepLocal_1 = var_1_6 | 5; [L53] COND TRUE stepLocal_1 <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))) [L54] var_1_12 = (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-1073741575, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19))))) VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-1073741575, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L91] EXPR var_1_6 | 5 VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-1073741575, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L91] EXPR (((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19))))) VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-1073741575, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L91-L92] return (((((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19)))))) && (var_1_18 == ((signed short int) var_1_5))) && (var_1_19 == ((unsigned short int) var_1_6)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-1073741575, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] [L19] reach_error() VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-1073741575, var_1_13=1073741822, var_1_15=1073741823, var_1_18=126, var_1_19=122, var_1_1=-127, var_1_2=0, var_1_3=4, var_1_5=126, var_1_6=122, var_1_7=-127, var_1_8=4, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 794 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 3830 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2819 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1663 IncrementalHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 1011 mSDtfsCounter, 1663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 201 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1320 NumberOfCodeBlocks, 1320 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1186 ConstructedInterpolants, 0 QuantifiedInterpolants, 4901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 6120/6120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 15:48:09,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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_floatingpointinfluence_no-floats_file-28.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 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:48:11,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:48:11,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:48:11,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:48:11,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:48:11,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:48:11,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:48:11,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:48:11,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:48:11,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:48:11,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:48:11,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:48:11,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:48:11,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:48:11,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:48:11,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:48:11,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:48:11,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:48:11,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:48:11,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:48:11,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:48:11,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:48:11,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:48:11,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:48:11,403 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:48:11,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:48:11,403 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:48:11,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:48:11,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:48:11,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:48:11,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:48:11,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:48:11,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:48:11,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:48:11,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:48:11,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:48:11,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:48:11,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:48:11,406 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:48:11,406 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:48:11,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:48:11,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:48:11,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:48:11,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:48:11,408 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 -> 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 [2024-11-16 15:48:11,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:48:11,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:48:11,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:48:11,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:48:11,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:48:11,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-16 15:48:13,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:48:13,221 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:48:13,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-16 15:48:13,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18ffd5cb/311c149e30e74be0b228cc534537abe8/FLAG72bae911c [2024-11-16 15:48:13,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18ffd5cb/311c149e30e74be0b228cc534537abe8 [2024-11-16 15:48:13,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:48:13,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:48:13,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:48:13,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:48:13,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:48:13,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd1b86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13, skipping insertion in model container [2024-11-16 15:48:13,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:48:13,416 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-16 15:48:13,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:48:13,467 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:48:13,475 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-16 15:48:13,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:48:13,508 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:48:13,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13 WrapperNode [2024-11-16 15:48:13,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:48:13,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:48:13,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:48:13,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:48:13,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,550 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-16 15:48:13,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:48:13,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:48:13,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:48:13,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:48:13,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:48:13,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:48:13,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:48:13,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:48:13,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:48:13,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (1/1) ... [2024-11-16 15:48:13,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:48:13,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:48:13,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:48:13,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:48:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:48:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:48:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:48:13,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:48:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:48:13,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:48:13,723 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:48:13,726 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:48:13,945 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 15:48:13,948 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:48:13,960 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:48:13,960 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:48:13,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:13 BoogieIcfgContainer [2024-11-16 15:48:13,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:48:13,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:48:13,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:48:13,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:48:13,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:48:13" (1/3) ... [2024-11-16 15:48:13,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce1be31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:13, skipping insertion in model container [2024-11-16 15:48:13,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:48:13" (2/3) ... [2024-11-16 15:48:13,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce1be31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:48:13, skipping insertion in model container [2024-11-16 15:48:13,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:48:13" (3/3) ... [2024-11-16 15:48:13,971 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-16 15:48:13,986 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:48:13,986 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:48:14,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:48:14,073 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;@69e6bb23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:48:14,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:48:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:48:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 15:48:14,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:14,089 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:14,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:14,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1521711558, now seen corresponding path program 1 times [2024-11-16 15:48:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:48:14,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950185603] [2024-11-16 15:48:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:14,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:48:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:48:14,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:48:14,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 15:48:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:14,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:48:14,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:48:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-16 15:48:14,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:48:14,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:48:14,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950185603] [2024-11-16 15:48:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950185603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:48:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:48:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:48:14,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733707011] [2024-11-16 15:48:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:48:14,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:48:14,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:48:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:48:14,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:48:14,338 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:48:14,361 INFO L93 Difference]: Finished difference Result 100 states and 165 transitions. [2024-11-16 15:48:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:48:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-16 15:48:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:48:14,369 INFO L225 Difference]: With dead ends: 100 [2024-11-16 15:48:14,370 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 15:48:14,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:48:14,376 INFO L432 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:48:14,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:48:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 15:48:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-16 15:48:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 15:48:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-16 15:48:14,416 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 115 [2024-11-16 15:48:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:48:14,417 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-16 15:48:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 15:48:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-16 15:48:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 15:48:14,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:48:14,420 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:48:14,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 15:48:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:48:14,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:48:14,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:48:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash 77534502, now seen corresponding path program 1 times [2024-11-16 15:48:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:48:14,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388176330] [2024-11-16 15:48:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:48:14,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:48:14,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:48:14,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:48:14,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 15:48:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:48:14,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 15:48:14,781 INFO L278 TraceCheckSpWp]: Computing forward predicates...