./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.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 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:55:53,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:55:54,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:55:54,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:55:54,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:55:54,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:55:54,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:55:54,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:55:54,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:55:54,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:55:54,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:55:54,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:55:54,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:55:54,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:55:54,061 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:55:54,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:55:54,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:55:54,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:55:54,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:55:54,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:55:54,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:55:54,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:55:54,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:55:54,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:55:54,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:55:54,065 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:55:54,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:55:54,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:55:54,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:55:54,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:55:54,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:55:54,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:55:54,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:55:54,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:55:54,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:55:54,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:55:54,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:55:54,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:55:54,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:55:54,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:55:54,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:55:54,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:55:54,068 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 -> 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f [2024-11-16 15:55:54,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:55:54,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:55:54,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:55:54,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:55:54,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:55:54,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-16 15:55:55,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:55:55,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:55:55,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-16 15:55:55,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a2ba1d3/93238349cc76476da48870d72f7acc4e/FLAGd4921cd48 [2024-11-16 15:55:56,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a2ba1d3/93238349cc76476da48870d72f7acc4e [2024-11-16 15:55:56,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:55:56,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:55:56,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:55:56,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:55:56,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:55:56,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693efdb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56, skipping insertion in model container [2024-11-16 15:55:56,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:55:56,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-16 15:55:56,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:55:56,479 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:55:56,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-16 15:55:56,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:55:56,566 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:55:56,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56 WrapperNode [2024-11-16 15:55:56,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:55:56,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:55:56,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:55:56,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:55:56,578 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:55:56" (1/1) ... [2024-11-16 15:55:56,591 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:55:56" (1/1) ... [2024-11-16 15:55:56,629 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2024-11-16 15:55:56,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:55:56,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:55:56,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:55:56,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:55:56,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,682 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:55:56,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:55:56,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:55:56,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:55:56,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:55:56,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (1/1) ... [2024-11-16 15:55:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:55:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:55:56,833 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:55:56,839 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:55:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:55:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:55:56,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:55:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:55:56,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:55:56,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:55:56,946 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:55:56,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:55:57,357 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc property_#t~bitwise20#1;havoc property_#t~bitwise21#1;havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2024-11-16 15:55:57,403 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-16 15:55:57,403 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:55:57,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:55:57,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:55:57,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:55:57 BoogieIcfgContainer [2024-11-16 15:55:57,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:55:57,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:55:57,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:55:57,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:55:57,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:55:56" (1/3) ... [2024-11-16 15:55:57,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c81d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:55:57, skipping insertion in model container [2024-11-16 15:55:57,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:55:56" (2/3) ... [2024-11-16 15:55:57,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c81d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:55:57, skipping insertion in model container [2024-11-16 15:55:57,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:55:57" (3/3) ... [2024-11-16 15:55:57,427 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-16 15:55:57,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:55:57,438 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:55:57,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:55:57,493 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;@5553d512, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:55:57,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:55:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 96 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:55:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 15:55:57,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:55:57,509 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:57,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:55:57,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:55:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash -554070655, now seen corresponding path program 1 times [2024-11-16 15:55:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:55:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606774178] [2024-11-16 15:55:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:55:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:55:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:55:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:55:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:55:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:55:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:55:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:55:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:55:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:55:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:55:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:55:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:55:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:55:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:55:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:55:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:55:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:55:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:55:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:55:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:55:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:55:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:55:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:55:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606774178] [2024-11-16 15:55:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606774178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:55:57,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:55:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:55:57,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173799404] [2024-11-16 15:55:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:55:57,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:55:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:55:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:55:57,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:55:57,889 INFO L87 Difference]: Start difference. First operand has 118 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 96 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:55:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:55:57,925 INFO L93 Difference]: Finished difference Result 232 states and 380 transitions. [2024-11-16 15:55:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:55:57,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-16 15:55:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:55:57,932 INFO L225 Difference]: With dead ends: 232 [2024-11-16 15:55:57,932 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 15:55:57,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:55:57,940 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:55:57,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:55:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 15:55:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-16 15:55:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:55:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2024-11-16 15:55:57,985 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 150 [2024-11-16 15:55:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:55:57,986 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2024-11-16 15:55:57,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:55:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2024-11-16 15:55:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 15:55:57,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:55:57,989 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:57,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:55:57,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:55:57,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:55:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1821414203, now seen corresponding path program 1 times [2024-11-16 15:55:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:55:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899310879] [2024-11-16 15:55:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:55:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:55:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:55:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:55:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:55:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:55:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:55:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:55:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:55:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:55:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:55:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:55:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:55:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:55:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:55:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:55:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:55:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:55:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:55:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:55:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:55:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:55:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:55:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:55:58,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899310879] [2024-11-16 15:55:58,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899310879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:55:58,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:55:58,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:55:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849072250] [2024-11-16 15:55:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:55:58,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:55:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:55:58,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:55:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:55:58,405 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:55:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:55:58,453 INFO L93 Difference]: Finished difference Result 224 states and 347 transitions. [2024-11-16 15:55:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:55:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-16 15:55:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:55:58,456 INFO L225 Difference]: With dead ends: 224 [2024-11-16 15:55:58,460 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 15:55:58,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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:55:58,461 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:55:58,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 319 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:55:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 15:55:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-16 15:55:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:55:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 175 transitions. [2024-11-16 15:55:58,480 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 175 transitions. Word has length 150 [2024-11-16 15:55:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:55:58,481 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 175 transitions. [2024-11-16 15:55:58,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:55:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 175 transitions. [2024-11-16 15:55:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 15:55:58,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:55:58,483 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:58,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:55:58,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:55:58,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:55:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash -341176611, now seen corresponding path program 1 times [2024-11-16 15:55:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:55:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599170441] [2024-11-16 15:55:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:55:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:55:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:55:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:55:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:55:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:55:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:55:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:55:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:55:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:55:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:55:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:55:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:55:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:55:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:55:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:55:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:55:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:55:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:55:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:55:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:55:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:55:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:55:59,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:55:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599170441] [2024-11-16 15:55:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599170441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:55:59,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:55:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:55:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595998237] [2024-11-16 15:55:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:55:59,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:55:59,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:55:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:55:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:55:59,064 INFO L87 Difference]: Start difference. First operand 114 states and 175 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:55:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:55:59,519 INFO L93 Difference]: Finished difference Result 543 states and 833 transitions. [2024-11-16 15:55:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:55:59,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2024-11-16 15:55:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:55:59,528 INFO L225 Difference]: With dead ends: 543 [2024-11-16 15:55:59,528 INFO L226 Difference]: Without dead ends: 432 [2024-11-16 15:55:59,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:55:59,529 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 599 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:55:59,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 734 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:55:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-16 15:55:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 287. [2024-11-16 15:55:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 244 states have (on average 1.5204918032786885) internal successors, (371), 244 states have internal predecessors, (371), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 15:55:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 451 transitions. [2024-11-16 15:55:59,581 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 451 transitions. Word has length 151 [2024-11-16 15:55:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:55:59,582 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 451 transitions. [2024-11-16 15:55:59,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:55:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 451 transitions. [2024-11-16 15:55:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 15:55:59,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:55:59,588 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:55:59,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:55:59,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:55:59,589 INFO L85 PathProgramCache]: Analyzing trace with hash -76583975, now seen corresponding path program 1 times [2024-11-16 15:55:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:55:59,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166554761] [2024-11-16 15:55:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:55:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:55:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:55:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:55:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:55:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:55:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:55:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:55:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:55:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:55:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:55:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:55:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:55:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:55:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:55:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:55:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:55:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:55:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:55:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166554761] [2024-11-16 15:56:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166554761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:00,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:00,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:00,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73740106] [2024-11-16 15:56:00,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:00,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:00,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:00,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:00,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:00,027 INFO L87 Difference]: Start difference. First operand 287 states and 451 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:00,238 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2024-11-16 15:56:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:00,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-16 15:56:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:00,242 INFO L225 Difference]: With dead ends: 810 [2024-11-16 15:56:00,242 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 15:56:00,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:00,243 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 166 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:00,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 427 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:56:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 15:56:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 485. [2024-11-16 15:56:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 421 states have (on average 1.5249406175771971) internal successors, (642), 421 states have internal predecessors, (642), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 15:56:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 762 transitions. [2024-11-16 15:56:00,273 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 762 transitions. Word has length 152 [2024-11-16 15:56:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:00,274 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 762 transitions. [2024-11-16 15:56:00,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 762 transitions. [2024-11-16 15:56:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 15:56:00,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:00,276 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:56:00,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 690638424, now seen corresponding path program 1 times [2024-11-16 15:56:00,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:00,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285641798] [2024-11-16 15:56:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285641798] [2024-11-16 15:56:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285641798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:00,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:56:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712245797] [2024-11-16 15:56:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:00,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:56:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:00,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:56:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:00,599 INFO L87 Difference]: Start difference. First operand 485 states and 762 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:56:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:00,835 INFO L93 Difference]: Finished difference Result 1191 states and 1869 transitions. [2024-11-16 15:56:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:56:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2024-11-16 15:56:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:00,838 INFO L225 Difference]: With dead ends: 1191 [2024-11-16 15:56:00,838 INFO L226 Difference]: Without dead ends: 797 [2024-11-16 15:56:00,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:56:00,840 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 294 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:00,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 412 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:56:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-16 15:56:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 792. [2024-11-16 15:56:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 708 states have (on average 1.521186440677966) internal successors, (1077), 710 states have internal predecessors, (1077), 78 states have call successors, (78), 5 states have call predecessors, (78), 5 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 15:56:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1233 transitions. [2024-11-16 15:56:00,871 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1233 transitions. Word has length 153 [2024-11-16 15:56:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:00,872 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1233 transitions. [2024-11-16 15:56:00,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:56:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1233 transitions. [2024-11-16 15:56:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 15:56:00,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:00,873 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:56:00,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1099462649, now seen corresponding path program 1 times [2024-11-16 15:56:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004197555] [2024-11-16 15:56:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004197555] [2024-11-16 15:56:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004197555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:56:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573124638] [2024-11-16 15:56:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:56:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:56:01,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:01,156 INFO L87 Difference]: Start difference. First operand 792 states and 1233 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:01,418 INFO L93 Difference]: Finished difference Result 2685 states and 4136 transitions. [2024-11-16 15:56:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:56:01,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-11-16 15:56:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:01,427 INFO L225 Difference]: With dead ends: 2685 [2024-11-16 15:56:01,427 INFO L226 Difference]: Without dead ends: 2062 [2024-11-16 15:56:01,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:56:01,430 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 528 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:01,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 681 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:56:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2024-11-16 15:56:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1454. [2024-11-16 15:56:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1308 states have (on average 1.5275229357798166) internal successors, (1998), 1312 states have internal predecessors, (1998), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-16 15:56:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2270 transitions. [2024-11-16 15:56:01,551 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2270 transitions. Word has length 153 [2024-11-16 15:56:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:01,553 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 2270 transitions. [2024-11-16 15:56:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2270 transitions. [2024-11-16 15:56:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 15:56:01,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:01,556 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:56:01,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:01,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1110778776, now seen corresponding path program 1 times [2024-11-16 15:56:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88585803] [2024-11-16 15:56:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:01,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:01,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88585803] [2024-11-16 15:56:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88585803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:01,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:01,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783494284] [2024-11-16 15:56:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:01,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:01,767 INFO L87 Difference]: Start difference. First operand 1454 states and 2270 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:01,924 INFO L93 Difference]: Finished difference Result 2934 states and 4542 transitions. [2024-11-16 15:56:01,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:01,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-11-16 15:56:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:01,929 INFO L225 Difference]: With dead ends: 2934 [2024-11-16 15:56:01,929 INFO L226 Difference]: Without dead ends: 1536 [2024-11-16 15:56:01,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:01,933 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 138 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:01,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 459 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-16 15:56:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1453. [2024-11-16 15:56:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1307 states have (on average 1.5263963274674828) internal successors, (1995), 1311 states have internal predecessors, (1995), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-16 15:56:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2267 transitions. [2024-11-16 15:56:01,994 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2267 transitions. Word has length 153 [2024-11-16 15:56:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:01,994 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2267 transitions. [2024-11-16 15:56:01,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2267 transitions. [2024-11-16 15:56:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 15:56:01,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:01,996 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 15:56:01,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 726030458, now seen corresponding path program 1 times [2024-11-16 15:56:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:01,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248475202] [2024-11-16 15:56:01,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:02,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:02,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248475202] [2024-11-16 15:56:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248475202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:02,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:02,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:02,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94398027] [2024-11-16 15:56:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:02,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:02,280 INFO L87 Difference]: Start difference. First operand 1453 states and 2267 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:02,482 INFO L93 Difference]: Finished difference Result 2557 states and 3929 transitions. [2024-11-16 15:56:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-11-16 15:56:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:02,486 INFO L225 Difference]: With dead ends: 2557 [2024-11-16 15:56:02,487 INFO L226 Difference]: Without dead ends: 1346 [2024-11-16 15:56:02,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:02,489 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 139 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:02,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 437 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2024-11-16 15:56:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1263. [2024-11-16 15:56:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1117 states have (on average 1.513876454789615) internal successors, (1691), 1121 states have internal predecessors, (1691), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-16 15:56:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1963 transitions. [2024-11-16 15:56:02,578 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1963 transitions. Word has length 153 [2024-11-16 15:56:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:02,578 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1963 transitions. [2024-11-16 15:56:02,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1963 transitions. [2024-11-16 15:56:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 15:56:02,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:02,579 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 15:56:02,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:02,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1184608945, now seen corresponding path program 1 times [2024-11-16 15:56:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157665442] [2024-11-16 15:56:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157665442] [2024-11-16 15:56:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157665442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:56:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532007968] [2024-11-16 15:56:02,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:02,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:56:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:56:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:56:02,847 INFO L87 Difference]: Start difference. First operand 1263 states and 1963 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-16 15:56:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:03,383 INFO L93 Difference]: Finished difference Result 2472 states and 3774 transitions. [2024-11-16 15:56:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:56:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2024-11-16 15:56:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:03,390 INFO L225 Difference]: With dead ends: 2472 [2024-11-16 15:56:03,390 INFO L226 Difference]: Without dead ends: 1989 [2024-11-16 15:56:03,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-16 15:56:03,393 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 696 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:03,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 804 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:56:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-11-16 15:56:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1374. [2024-11-16 15:56:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1196 states have (on average 1.4891304347826086) internal successors, (1781), 1198 states have internal predecessors, (1781), 158 states have call successors, (158), 19 states have call predecessors, (158), 19 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-16 15:56:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2097 transitions. [2024-11-16 15:56:03,464 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2097 transitions. Word has length 153 [2024-11-16 15:56:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:03,464 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2097 transitions. [2024-11-16 15:56:03,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-16 15:56:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2097 transitions. [2024-11-16 15:56:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 15:56:03,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:03,466 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:03,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 15:56:03,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:03,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash -853447344, now seen corresponding path program 1 times [2024-11-16 15:56:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:03,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409686853] [2024-11-16 15:56:03,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:03,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:03,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409686853] [2024-11-16 15:56:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409686853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:56:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594942291] [2024-11-16 15:56:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:03,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:56:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:56:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:56:03,710 INFO L87 Difference]: Start difference. First operand 1374 states and 2097 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:03,994 INFO L93 Difference]: Finished difference Result 2688 states and 4072 transitions. [2024-11-16 15:56:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:56:03,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-11-16 15:56:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:03,999 INFO L225 Difference]: With dead ends: 2688 [2024-11-16 15:56:04,000 INFO L226 Difference]: Without dead ends: 1457 [2024-11-16 15:56:04,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:56:04,002 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 163 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:04,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 666 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:56:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-11-16 15:56:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1374. [2024-11-16 15:56:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1196 states have (on average 1.4882943143812708) internal successors, (1780), 1198 states have internal predecessors, (1780), 158 states have call successors, (158), 19 states have call predecessors, (158), 19 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-16 15:56:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2096 transitions. [2024-11-16 15:56:04,077 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2096 transitions. Word has length 153 [2024-11-16 15:56:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:04,077 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2096 transitions. [2024-11-16 15:56:04,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2096 transitions. [2024-11-16 15:56:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-16 15:56:04,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:04,079 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 15:56:04,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:04,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 824522385, now seen corresponding path program 1 times [2024-11-16 15:56:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:04,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970876032] [2024-11-16 15:56:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:04,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:04,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970876032] [2024-11-16 15:56:04,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970876032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:04,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:04,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375334063] [2024-11-16 15:56:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:04,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:04,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:04,394 INFO L87 Difference]: Start difference. First operand 1374 states and 2096 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:04,667 INFO L93 Difference]: Finished difference Result 3939 states and 6028 transitions. [2024-11-16 15:56:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-16 15:56:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:04,675 INFO L225 Difference]: With dead ends: 3939 [2024-11-16 15:56:04,675 INFO L226 Difference]: Without dead ends: 2621 [2024-11-16 15:56:04,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:04,678 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 243 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:04,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 523 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:56:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2024-11-16 15:56:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2309. [2024-11-16 15:56:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2054 states have (on average 1.4892891918208373) internal successors, (3059), 2057 states have internal predecessors, (3059), 227 states have call successors, (227), 27 states have call predecessors, (227), 27 states have return successors, (227), 224 states have call predecessors, (227), 227 states have call successors, (227) [2024-11-16 15:56:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3513 transitions. [2024-11-16 15:56:04,781 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3513 transitions. Word has length 154 [2024-11-16 15:56:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:04,781 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 3513 transitions. [2024-11-16 15:56:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3513 transitions. [2024-11-16 15:56:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-16 15:56:04,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:04,806 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 15:56:04,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:04,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:04,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1652707373, now seen corresponding path program 1 times [2024-11-16 15:56:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693563455] [2024-11-16 15:56:04,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:04,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:04,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:04,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693563455] [2024-11-16 15:56:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693563455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:04,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581068383] [2024-11-16 15:56:04,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:04,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:04,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:04,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:04,958 INFO L87 Difference]: Start difference. First operand 2309 states and 3513 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:05,223 INFO L93 Difference]: Finished difference Result 6650 states and 10161 transitions. [2024-11-16 15:56:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:05,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-16 15:56:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:05,236 INFO L225 Difference]: With dead ends: 6650 [2024-11-16 15:56:05,236 INFO L226 Difference]: Without dead ends: 4397 [2024-11-16 15:56:05,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:05,240 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 242 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:05,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 548 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2024-11-16 15:56:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4111. [2024-11-16 15:56:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 3702 states have (on average 1.4910858995137763) internal successors, (5520), 3707 states have internal predecessors, (5520), 365 states have call successors, (365), 43 states have call predecessors, (365), 43 states have return successors, (365), 360 states have call predecessors, (365), 365 states have call successors, (365) [2024-11-16 15:56:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6250 transitions. [2024-11-16 15:56:05,446 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6250 transitions. Word has length 156 [2024-11-16 15:56:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:05,446 INFO L471 AbstractCegarLoop]: Abstraction has 4111 states and 6250 transitions. [2024-11-16 15:56:05,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6250 transitions. [2024-11-16 15:56:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 15:56:05,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:05,449 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:05,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 15:56:05,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash 730721063, now seen corresponding path program 1 times [2024-11-16 15:56:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:05,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727267881] [2024-11-16 15:56:05,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:05,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727267881] [2024-11-16 15:56:05,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727267881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:05,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:56:05,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981368369] [2024-11-16 15:56:05,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:05,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:56:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:05,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:56:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:56:05,863 INFO L87 Difference]: Start difference. First operand 4111 states and 6250 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:56:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:06,578 INFO L93 Difference]: Finished difference Result 11189 states and 16970 transitions. [2024-11-16 15:56:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 15:56:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2024-11-16 15:56:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:06,602 INFO L225 Difference]: With dead ends: 11189 [2024-11-16 15:56:06,602 INFO L226 Difference]: Without dead ends: 7344 [2024-11-16 15:56:06,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-16 15:56:06,609 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 913 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:06,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 966 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:56:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7344 states. [2024-11-16 15:56:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7344 to 4340. [2024-11-16 15:56:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4340 states, 3931 states have (on average 1.5006359704909693) internal successors, (5899), 3936 states have internal predecessors, (5899), 365 states have call successors, (365), 43 states have call predecessors, (365), 43 states have return successors, (365), 360 states have call predecessors, (365), 365 states have call successors, (365) [2024-11-16 15:56:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 6629 transitions. [2024-11-16 15:56:06,848 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 6629 transitions. Word has length 158 [2024-11-16 15:56:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:06,848 INFO L471 AbstractCegarLoop]: Abstraction has 4340 states and 6629 transitions. [2024-11-16 15:56:06,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:56:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 6629 transitions. [2024-11-16 15:56:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 15:56:06,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:06,850 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 15:56:06,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:06,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1526189944, now seen corresponding path program 1 times [2024-11-16 15:56:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767234609] [2024-11-16 15:56:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767234609] [2024-11-16 15:56:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767234609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141789843] [2024-11-16 15:56:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:07,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:07,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:07,056 INFO L87 Difference]: Start difference. First operand 4340 states and 6629 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:07,249 INFO L93 Difference]: Finished difference Result 8703 states and 13295 transitions. [2024-11-16 15:56:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:07,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-16 15:56:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:07,268 INFO L225 Difference]: With dead ends: 8703 [2024-11-16 15:56:07,271 INFO L226 Difference]: Without dead ends: 4420 [2024-11-16 15:56:07,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:07,276 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:07,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 479 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:56:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-11-16 15:56:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 4420. [2024-11-16 15:56:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4420 states, 4011 states have (on average 1.4951383694839193) internal successors, (5997), 4016 states have internal predecessors, (5997), 365 states have call successors, (365), 43 states have call predecessors, (365), 43 states have return successors, (365), 360 states have call predecessors, (365), 365 states have call successors, (365) [2024-11-16 15:56:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 6727 transitions. [2024-11-16 15:56:07,441 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 6727 transitions. Word has length 158 [2024-11-16 15:56:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:07,442 INFO L471 AbstractCegarLoop]: Abstraction has 4420 states and 6727 transitions. [2024-11-16 15:56:07,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 6727 transitions. [2024-11-16 15:56:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 15:56:07,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:07,444 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 15:56:07,445 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:07,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash 424110311, now seen corresponding path program 1 times [2024-11-16 15:56:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012608199] [2024-11-16 15:56:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:56:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:56:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:56:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:56:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:56:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:56:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:56:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 15:56:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:56:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 15:56:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012608199] [2024-11-16 15:56:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012608199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:56:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567963530] [2024-11-16 15:56:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:07,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:56:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:07,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:56:07,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:56:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:07,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 15:56:07,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-16 15:56:07,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:56:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 15:56:08,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567963530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:56:08,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:56:08,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 15:56:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094725974] [2024-11-16 15:56:08,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:56:08,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:56:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:56:08,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:56:08,108 INFO L87 Difference]: Start difference. First operand 4420 states and 6727 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 15:56:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:08,437 INFO L93 Difference]: Finished difference Result 8893 states and 13448 transitions. [2024-11-16 15:56:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 15:56:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 158 [2024-11-16 15:56:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:08,451 INFO L225 Difference]: With dead ends: 8893 [2024-11-16 15:56:08,451 INFO L226 Difference]: Without dead ends: 4530 [2024-11-16 15:56:08,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:56:08,459 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 238 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:08,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 346 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2024-11-16 15:56:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 4424. [2024-11-16 15:56:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 3994 states have (on average 1.4737105658487732) internal successors, (5886), 3999 states have internal predecessors, (5886), 365 states have call successors, (365), 64 states have call predecessors, (365), 64 states have return successors, (365), 360 states have call predecessors, (365), 365 states have call successors, (365) [2024-11-16 15:56:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 6616 transitions. [2024-11-16 15:56:08,644 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 6616 transitions. Word has length 158 [2024-11-16 15:56:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:08,644 INFO L471 AbstractCegarLoop]: Abstraction has 4424 states and 6616 transitions. [2024-11-16 15:56:08,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 15:56:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6616 transitions. [2024-11-16 15:56:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-16 15:56:08,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:08,646 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 15:56:08,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 15:56:08,847 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:08,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash -358927235, now seen corresponding path program 1 times [2024-11-16 15:56:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:08,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491578323] [2024-11-16 15:56:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:56:09,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195518126] [2024-11-16 15:56:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:09,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:56:09,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:09,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:56:09,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 15:56:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:56:09,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:56:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:56:09,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:56:09,403 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:56:09,404 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:56:09,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 15:56:09,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-16 15:56:09,610 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:09,726 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:56:09,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:56:09 BoogieIcfgContainer [2024-11-16 15:56:09,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:56:09,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:56:09,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:56:09,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:56:09,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:55:57" (3/4) ... [2024-11-16 15:56:09,732 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:56:09,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:56:09,733 INFO L158 Benchmark]: Toolchain (without parser) took 13498.91ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 114.9MB in the beginning and 977.8MB in the end (delta: -862.9MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-11-16 15:56:09,733 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 84.6MB in the beginning and 84.5MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:56:09,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.86ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 96.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 15:56:09,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.56ms. Allocated memory is still 184.5MB. Free memory was 96.5MB in the beginning and 89.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 15:56:09,734 INFO L158 Benchmark]: Boogie Preprocessor took 147.24ms. Allocated memory is still 184.5MB. Free memory was 89.4MB in the beginning and 151.9MB in the end (delta: -62.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-16 15:56:09,734 INFO L158 Benchmark]: IcfgBuilder took 643.60ms. Allocated memory is still 184.5MB. Free memory was 151.9MB in the beginning and 109.0MB in the end (delta: 42.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-16 15:56:09,735 INFO L158 Benchmark]: TraceAbstraction took 12305.82ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 108.1MB in the beginning and 977.8MB in the end (delta: -869.7MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2024-11-16 15:56:09,735 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 1.1GB. Free memory is still 977.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:56:09,736 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 84.6MB in the beginning and 84.5MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.86ms. Allocated memory is still 184.5MB. Free memory was 114.6MB in the beginning and 96.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.56ms. Allocated memory is still 184.5MB. Free memory was 96.5MB in the beginning and 89.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 147.24ms. Allocated memory is still 184.5MB. Free memory was 89.4MB in the beginning and 151.9MB in the end (delta: -62.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * IcfgBuilder took 643.60ms. Allocated memory is still 184.5MB. Free memory was 151.9MB in the beginning and 109.0MB in the end (delta: 42.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12305.82ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 916.5MB). Free memory was 108.1MB in the beginning and 977.8MB in the end (delta: -869.7MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 1.1GB. Free memory is still 977.8MB. 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 someBinaryDOUBLEComparisonOperation at line 189, overapproximation of bitwiseOr at line 189, overapproximation of bitwiseAnd at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.75; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_6 = -4; [L25] double var_1_7 = 49.8; [L26] double var_1_8 = 255.625; [L27] unsigned short int var_1_9 = 10; [L28] unsigned short int var_1_11 = 10000; [L29] signed char var_1_12 = 100; [L30] signed char var_1_13 = 16; [L31] unsigned long int var_1_14 = 4; [L32] signed short int var_1_15 = -16; [L33] unsigned char var_1_17 = 5; [L34] double var_1_18 = 64.75; [L35] double var_1_19 = 99.5; [L36] unsigned long int var_1_20 = 32; [L37] unsigned long int var_1_22 = 32; [L38] unsigned long int var_1_23 = 2461517415; [L39] unsigned long int var_1_24 = 1399914902; [L40] unsigned char var_1_25 = 2; [L41] signed long int var_1_26 = 4; [L42] unsigned char var_1_27 = 0; [L43] unsigned short int var_1_28 = 32; [L44] unsigned short int var_1_29 = 36457; [L45] double last_1_var_1_1 = 4.75; [L46] unsigned short int last_1_var_1_9 = 10; [L47] unsigned short int last_1_var_1_11 = 10000; [L48] unsigned long int last_1_var_1_14 = 4; [L49] signed short int last_1_var_1_15 = -16; [L50] unsigned char last_1_var_1_17 = 5; [L51] double last_1_var_1_18 = 64.75; [L52] unsigned long int last_1_var_1_20 = 32; [L53] unsigned long int last_1_var_1_22 = 32; [L54] unsigned char last_1_var_1_25 = 2; [L55] signed long int last_1_var_1_26 = 4; [L56] unsigned short int last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L193] isInitial = 1 [L194] FCALL initially() [L195] int k_loop; [L196] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L196] COND TRUE k_loop < 1 [L197] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_11 = var_1_11 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_15 = var_1_15 [L180] last_1_var_1_17 = var_1_17 [L181] last_1_var_1_18 = var_1_18 [L182] last_1_var_1_20 = var_1_20 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_25 = var_1_25 [L185] last_1_var_1_26 = var_1_26 [L186] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L145] var_1_6 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L146] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L152] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L153] var_1_12 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L154] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L156] var_1_13 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L159] var_1_19 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L160] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L161] var_1_23 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L162] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L164] var_1_24 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_24 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L165] RET assume_abort_if_not(var_1_24 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L170] var_1_29 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L171] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L198] RET updateVariables() [L199] CALL step() [L60] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L60] signed long int stepLocal_0 = var_1_6 & 10000; [L61] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_0=10000, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L61] COND TRUE ((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < stepLocal_0 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L66] COND TRUE last_1_var_1_14 <= last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L67] COND TRUE ((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13))) [L68] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L75] COND FALSE !(last_1_var_1_20 > last_1_var_1_15) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L80] COND TRUE last_1_var_1_14 <= 16 [L81] var_1_9 = last_1_var_1_25 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L84] unsigned long int stepLocal_5 = (3423867512u - var_1_13) - var_1_24; [L85] signed long int stepLocal_4 = 8; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] EXPR last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] COND TRUE stepLocal_4 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25)))) [L87] COND FALSE !(var_1_8 >= last_1_var_1_18) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] EXPR last_1_var_1_11 >> var_1_14 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] COND FALSE !(! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) [L98] signed char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_1=0, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L99] COND TRUE (var_1_9 + var_1_25) >= stepLocal_1 [L100] var_1_18 = ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L102] var_1_17 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L103] COND TRUE ! var_1_2 [L104] var_1_22 = (var_1_23 - var_1_25) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L108] COND TRUE var_1_7 >= 4.5 [L109] var_1_15 = (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L111] var_1_28 = (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) [L112] unsigned long int stepLocal_3 = var_1_22; [L113] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_2=0, stepLocal_3=-2147483651, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L114] COND TRUE stepLocal_2 == (var_1_6 * (var_1_12 - 64)) [L115] var_1_20 = var_1_17 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L125] unsigned long int stepLocal_7 = var_1_14; [L126] unsigned long int stepLocal_6 = var_1_23; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=6645092985, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L127] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=-2147483651, stepLocal_5=6645092985, stepLocal_6=-2147483649, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L199] RET step() [L200] CALL, EXPR property() [L189] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR (((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR ((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189-L190] return ((((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13)))) && (var_1_2 ? ((var_1_23 >= var_1_25) ? (((var_1_25 - 10) <= var_1_14) ? (var_1_27 ? (var_1_26 == ((signed long int) (((((((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) < (var_1_17)) ? (((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) : (var_1_17))) + var_1_17))) : 1) : (var_1_26 == ((signed long int) ((((var_1_12) < (var_1_17)) ? (var_1_12) : (var_1_17)))))) : (var_1_26 == ((signed long int) ((-32 + var_1_22) + var_1_14)))) : 1)) && (var_1_28 == ((unsigned short int) (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=-2147483651, var_1_23=-2147483649, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=1, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4367 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4365 mSDsluCounter, 7969 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5353 mSDsCounter, 849 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1988 IncrementalHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 849 mSolverCounterUnsat, 2616 mSDtfsCounter, 1988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1057 GetRequests, 984 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4424occurred in iteration=15, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 5371 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2783 NumberOfCodeBlocks, 2783 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2604 ConstructedInterpolants, 0 QuantifiedInterpolants, 8560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 417 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 12785/12920 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:56:09,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.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 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:56:11,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:56:11,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:56:11,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:56:11,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:56:11,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:56:11,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:56:11,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:56:11,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:56:11,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:56:11,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:56:11,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:56:11,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:56:11,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:56:11,817 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:56:11,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:56:11,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:56:11,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:56:11,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:56:11,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:56:11,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:56:11,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:56:11,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:56:11,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:56:11,821 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:56:11,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:56:11,822 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:56:11,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:56:11,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:56:11,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:56:11,822 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:56:11,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:56:11,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:56:11,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:56:11,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:11,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:56:11,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:56:11,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:56:11,823 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:56:11,823 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:56:11,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:56:11,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:56:11,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:56:11,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:56:11,825 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 -> 61d8b31ff1e9b7ded83368278938f158cc1aa40ff57fbd8a739b93a1e5cab26f [2024-11-16 15:56:12,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:56:12,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:56:12,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:56:12,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:56:12,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:56:12,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-16 15:56:13,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:56:13,533 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:56:13,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-16 15:56:13,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19f8f92c/17cb37ded2454ad1bdd099aa12b8dbfd/FLAG98ad2c451 [2024-11-16 15:56:13,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a19f8f92c/17cb37ded2454ad1bdd099aa12b8dbfd [2024-11-16 15:56:13,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:56:13,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:56:13,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:13,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:56:13,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:56:13,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:13" (1/1) ... [2024-11-16 15:56:13,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7360c8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:13, skipping insertion in model container [2024-11-16 15:56:13,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:13" (1/1) ... [2024-11-16 15:56:13,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:56:14,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-16 15:56:14,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:14,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:56:14,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-11.i[916,929] [2024-11-16 15:56:14,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:14,261 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:56:14,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14 WrapperNode [2024-11-16 15:56:14,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:14,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:14,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:56:14,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:56:14,269 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:56:14" (1/1) ... [2024-11-16 15:56:14,283 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:56:14" (1/1) ... [2024-11-16 15:56:14,315 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-16 15:56:14,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:14,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:56:14,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:56:14,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:56:14,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,349 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:56:14,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:56:14,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:56:14,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:56:14,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:56:14,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (1/1) ... [2024-11-16 15:56:14,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:14,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:14,390 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:56:14,396 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:56:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:56:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:56:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:56:14,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:56:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:56:14,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:56:14,508 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:56:14,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:56:20,420 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-16 15:56:20,421 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:56:20,430 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:56:20,430 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:56:20,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:20 BoogieIcfgContainer [2024-11-16 15:56:20,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:56:20,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:56:20,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:56:20,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:56:20,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:56:13" (1/3) ... [2024-11-16 15:56:20,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cea282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:20, skipping insertion in model container [2024-11-16 15:56:20,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:14" (2/3) ... [2024-11-16 15:56:20,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cea282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:20, skipping insertion in model container [2024-11-16 15:56:20,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:20" (3/3) ... [2024-11-16 15:56:20,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-11.i [2024-11-16 15:56:20,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:56:20,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:56:20,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:56:20,496 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;@41ccf839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:56:20,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:56:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:56:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 15:56:20,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:20,508 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:20,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash 425818074, now seen corresponding path program 1 times [2024-11-16 15:56:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404796808] [2024-11-16 15:56:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:20,522 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:56:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:20,524 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:56:20,548 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:56:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:20,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:56:20,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-16 15:56:20,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:20,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:20,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404796808] [2024-11-16 15:56:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404796808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:56:20,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207399097] [2024-11-16 15:56:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:20,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:56:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:56:21,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:56:21,002 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:56:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:21,031 INFO L93 Difference]: Finished difference Result 152 states and 256 transitions. [2024-11-16 15:56:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:56:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2024-11-16 15:56:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:21,040 INFO L225 Difference]: With dead ends: 152 [2024-11-16 15:56:21,041 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 15:56:21,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 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:56:21,048 INFO L432 NwaCegarLoop]: 116 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, 116 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:56:21,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:56:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 15:56:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 15:56:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 15:56:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-16 15:56:21,083 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 138 [2024-11-16 15:56:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:21,083 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-16 15:56:21,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 15:56:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-16 15:56:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 15:56:21,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:21,087 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:21,099 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:56:21,287 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:56:21,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1168564962, now seen corresponding path program 1 times [2024-11-16 15:56:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832052938] [2024-11-16 15:56:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:21,290 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:56:21,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:21,293 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:56:21,293 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:56:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:21,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 15:56:21,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:23,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:23,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832052938] [2024-11-16 15:56:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832052938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:23,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:56:23,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088009142] [2024-11-16 15:56:23,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:23,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:23,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:23,387 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:26,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:56:28,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:56:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:28,565 INFO L93 Difference]: Finished difference Result 215 states and 332 transitions. [2024-11-16 15:56:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:28,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-16 15:56:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:28,597 INFO L225 Difference]: With dead ends: 215 [2024-11-16 15:56:28,597 INFO L226 Difference]: Without dead ends: 145 [2024-11-16 15:56:28,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:28,598 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 72 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:28,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 298 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-16 15:56:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-16 15:56:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2024-11-16 15:56:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 15:56:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 177 transitions. [2024-11-16 15:56:28,617 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 177 transitions. Word has length 138 [2024-11-16 15:56:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:28,618 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 177 transitions. [2024-11-16 15:56:28,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 177 transitions. [2024-11-16 15:56:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 15:56:28,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:28,620 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:28,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 15:56:28,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:56:28,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1489040958, now seen corresponding path program 1 times [2024-11-16 15:56:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324775118] [2024-11-16 15:56:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:28,823 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:56:28,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:28,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:56:28,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 15:56:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:29,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 15:56:29,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:30,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:30,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324775118] [2024-11-16 15:56:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324775118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:30,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:30,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:56:30,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006026556] [2024-11-16 15:56:30,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:30,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:30,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:30,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:30,727 INFO L87 Difference]: Start difference. First operand 116 states and 177 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:33,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:56:34,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:56:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:34,641 INFO L93 Difference]: Finished difference Result 273 states and 418 transitions. [2024-11-16 15:56:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-16 15:56:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:34,645 INFO L225 Difference]: With dead ends: 273 [2024-11-16 15:56:34,645 INFO L226 Difference]: Without dead ends: 203 [2024-11-16 15:56:34,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:34,646 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 111 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:34,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 331 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-16 15:56:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-16 15:56:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2024-11-16 15:56:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 15:56:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 278 transitions. [2024-11-16 15:56:34,681 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 278 transitions. Word has length 139 [2024-11-16 15:56:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:34,681 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 278 transitions. [2024-11-16 15:56:34,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 278 transitions. [2024-11-16 15:56:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 15:56:34,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:34,683 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:34,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 15:56:34,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:56:34,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:34,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash 964382114, now seen corresponding path program 1 times [2024-11-16 15:56:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553232811] [2024-11-16 15:56:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:34,889 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:56:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:34,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:56:34,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 15:56:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:35,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 15:56:35,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:35,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:35,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553232811] [2024-11-16 15:56:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553232811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:35,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737931648] [2024-11-16 15:56:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:56:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:35,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:56:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:35,715 INFO L87 Difference]: Start difference. First operand 181 states and 278 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:37,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:56:40,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:56:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:40,749 INFO L93 Difference]: Finished difference Result 495 states and 766 transitions. [2024-11-16 15:56:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:56:40,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-16 15:56:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:40,780 INFO L225 Difference]: With dead ends: 495 [2024-11-16 15:56:40,780 INFO L226 Difference]: Without dead ends: 360 [2024-11-16 15:56:40,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:56:40,782 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 148 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:40,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 345 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-16 15:56:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-16 15:56:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 313. [2024-11-16 15:56:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 207 states have (on average 1.3768115942028984) internal successors, (285), 207 states have internal predecessors, (285), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 15:56:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 485 transitions. [2024-11-16 15:56:40,847 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 485 transitions. Word has length 139 [2024-11-16 15:56:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:40,849 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 485 transitions. [2024-11-16 15:56:40,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 485 transitions. [2024-11-16 15:56:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 15:56:40,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:40,863 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:40,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 15:56:41,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:56:41,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:41,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash 203923998, now seen corresponding path program 1 times [2024-11-16 15:56:41,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:41,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997272237] [2024-11-16 15:56:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:41,071 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:56:41,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:41,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:56:41,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 15:56:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:41,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 15:56:41,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-16 15:56:42,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:56:43,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:43,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997272237] [2024-11-16 15:56:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997272237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:56:43,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [875261238] [2024-11-16 15:56:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 15:56:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 15:56:43,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 15:56:43,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-16 15:56:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:43,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 15:56:43,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 15:56:46,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [875261238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 15:56:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-11-16 15:56:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184672835] [2024-11-16 15:56:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:56:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:46,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:56:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-16 15:56:46,457 INFO L87 Difference]: Start difference. First operand 313 states and 485 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:56:50,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 15:56:54,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 15:56:58,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:57:01,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 15:57:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:57:02,202 INFO L93 Difference]: Finished difference Result 944 states and 1449 transitions. [2024-11-16 15:57:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:57:02,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-16 15:57:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:57:02,212 INFO L225 Difference]: With dead ends: 944 [2024-11-16 15:57:02,212 INFO L226 Difference]: Without dead ends: 677 [2024-11-16 15:57:02,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-16 15:57:02,214 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 333 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:57:02,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 444 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2024-11-16 15:57:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-16 15:57:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 537. [2024-11-16 15:57:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 369 states have (on average 1.3902439024390243) internal successors, (513), 371 states have internal predecessors, (513), 158 states have call successors, (158), 9 states have call predecessors, (158), 9 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-16 15:57:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 829 transitions. [2024-11-16 15:57:02,285 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 829 transitions. Word has length 140 [2024-11-16 15:57:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:57:02,288 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 829 transitions. [2024-11-16 15:57:02,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 15:57:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 829 transitions. [2024-11-16 15:57:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 15:57:02,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:57:02,290 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:57:02,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-16 15:57:02,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 15:57:02,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:57:02,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:57:02,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:57:02,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1711475807, now seen corresponding path program 1 times [2024-11-16 15:57:02,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:57:02,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732324228] [2024-11-16 15:57:02,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:57:02,695 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:57:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:57:02,698 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:57:02,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 15:57:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:57:03,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 15:57:03,023 INFO L278 TraceCheckSpWp]: Computing forward predicates...