./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.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 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:26:36,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:26:36,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:26:36,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:26:36,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:26:36,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:26:36,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:26:36,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:26:36,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:26:36,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:26:36,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:26:36,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:26:36,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:26:36,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:26:36,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:26:36,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:26:36,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:26:36,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:26:36,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:26:36,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:26:36,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:26:36,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:26:36,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:26:36,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:26:36,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:26:36,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:26:36,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:26:36,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:26:36,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:26:36,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:26:36,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:26:36,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:26:36,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:26:36,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:26:36,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:26:36,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:26:36,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:26:36,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:26:36,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:26:36,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:26:36,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:26:36,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:26:36,437 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 -> 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f [2024-11-10 03:26:36,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:26:36,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:26:36,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:26:36,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:26:36,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:26:36,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-11-10 03:26:37,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:26:38,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:26:38,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-11-10 03:26:38,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74284d191/25c6805b51ac4aff9a8ca134c90165c6/FLAGfdc8570ab [2024-11-10 03:26:38,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74284d191/25c6805b51ac4aff9a8ca134c90165c6 [2024-11-10 03:26:38,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:26:38,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:26:38,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:26:38,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:26:38,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:26:38,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1980453a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38, skipping insertion in model container [2024-11-10 03:26:38,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:26:38,204 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_codestructure_normal_file-84.i[913,926] [2024-11-10 03:26:38,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:26:38,265 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:26:38,273 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_codestructure_normal_file-84.i[913,926] [2024-11-10 03:26:38,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:26:38,313 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:26:38,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38 WrapperNode [2024-11-10 03:26:38,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:26:38,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:26:38,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:26:38,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:26:38,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,390 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-11-10 03:26:38,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:26:38,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:26:38,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:26:38,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:26:38,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,446 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:26:38,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:26:38,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:26:38,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:26:38,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:26:38,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (1/1) ... [2024-11-10 03:26:38,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:26:38,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:26:38,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:26:38,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:26:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:26:38,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:26:38,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:26:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:26:38,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:26:38,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:26:38,606 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:26:38,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:26:38,903 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2024-11-10 03:26:38,939 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 03:26:38,940 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:26:38,965 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:26:38,965 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:26:38,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:26:38 BoogieIcfgContainer [2024-11-10 03:26:38,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:26:38,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:26:38,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:26:38,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:26:38,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:26:38" (1/3) ... [2024-11-10 03:26:38,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526fdd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:26:38, skipping insertion in model container [2024-11-10 03:26:38,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:38" (2/3) ... [2024-11-10 03:26:38,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526fdd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:26:38, skipping insertion in model container [2024-11-10 03:26:38,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:26:38" (3/3) ... [2024-11-10 03:26:38,974 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-84.i [2024-11-10 03:26:38,988 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:26:38,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:26:39,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:26:39,042 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;@6b5d8308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:26:39,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:26:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:26:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:26:39,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:39,055 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:39,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:39,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 275461837, now seen corresponding path program 1 times [2024-11-10 03:26:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534334918] [2024-11-10 03:26:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:26:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:26:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:26:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:26:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:26:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:26:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:26:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:26:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:26:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:26:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:26:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:26:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:26:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:26:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:26:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:26:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:26:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:26:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:26:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:26:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:26:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:26:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:26:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:26:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:26:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:26:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:26:39,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:26:39,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534334918] [2024-11-10 03:26:39,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534334918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:26:39,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:26:39,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:26:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348190799] [2024-11-10 03:26:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:26:39,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:26:39,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:26:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:26:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:26:39,482 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:26:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:39,521 INFO L93 Difference]: Finished difference Result 166 states and 285 transitions. [2024-11-10 03:26:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:26:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-11-10 03:26:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:39,528 INFO L225 Difference]: With dead ends: 166 [2024-11-10 03:26:39,529 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 03:26:39,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:26:39,537 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:39,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:26:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 03:26:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 03:26:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:26:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-10 03:26:39,584 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 166 [2024-11-10 03:26:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:39,584 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-10 03:26:39,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:26:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-10 03:26:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 03:26:39,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:39,587 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:26:39,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1109017013, now seen corresponding path program 1 times [2024-11-10 03:26:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100607282] [2024-11-10 03:26:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:26:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:26:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:26:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:26:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:26:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:26:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:26:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:26:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:26:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:26:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:26:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:26:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:26:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:26:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:26:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:26:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:26:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:26:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:26:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:26:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:26:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:26:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:26:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:26:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:26:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:26:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:26:42,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:26:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100607282] [2024-11-10 03:26:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100607282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:26:42,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:26:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:26:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529728233] [2024-11-10 03:26:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:26:42,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:26:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:26:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:26:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:26:42,143 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:43,242 INFO L93 Difference]: Finished difference Result 229 states and 345 transitions. [2024-11-10 03:26:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:26:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-11-10 03:26:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:43,247 INFO L225 Difference]: With dead ends: 229 [2024-11-10 03:26:43,247 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 03:26:43,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:26:43,248 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 112 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:43,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 310 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:26:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 03:26:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 96. [2024-11-10 03:26:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:26:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-11-10 03:26:43,263 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 148 transitions. Word has length 166 [2024-11-10 03:26:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:43,264 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-10 03:26:43,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:43,265 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2024-11-10 03:26:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 03:26:43,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:43,267 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:43,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:26:43,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:43,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 873563610, now seen corresponding path program 1 times [2024-11-10 03:26:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121333190] [2024-11-10 03:26:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:26:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:26:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:26:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:26:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:26:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:26:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:26:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:26:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:26:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:26:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:26:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:26:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:26:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:26:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:26:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:26:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:26:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:26:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:26:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:26:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:26:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:26:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:26:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:26:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:26:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:26:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:26:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:26:44,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121333190] [2024-11-10 03:26:44,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121333190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:26:44,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:26:44,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:26:44,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296041049] [2024-11-10 03:26:44,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:26:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:26:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:26:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:26:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:26:44,374 INFO L87 Difference]: Start difference. First operand 96 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:44,671 INFO L93 Difference]: Finished difference Result 226 states and 345 transitions. [2024-11-10 03:26:44,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:26:44,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-10 03:26:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:44,675 INFO L225 Difference]: With dead ends: 226 [2024-11-10 03:26:44,675 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 03:26:44,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:26:44,678 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 90 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:44,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 343 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:26:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 03:26:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2024-11-10 03:26:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:26:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-11-10 03:26:44,689 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 148 transitions. Word has length 167 [2024-11-10 03:26:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:44,690 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-10 03:26:44,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2024-11-10 03:26:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 03:26:44,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:44,694 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:44,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:26:44,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:44,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2068093989, now seen corresponding path program 1 times [2024-11-10 03:26:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:44,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212619328] [2024-11-10 03:26:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:26:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:26:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:26:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:26:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:26:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:26:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:26:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:26:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:26:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:26:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:26:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:26:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:26:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:26:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:26:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:26:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:26:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:26:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:26:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:26:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:26:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:26:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:26:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:26:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:26:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:26:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:26:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:26:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212619328] [2024-11-10 03:26:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212619328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:26:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:26:45,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:26:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930819199] [2024-11-10 03:26:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:26:45,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:26:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:26:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:26:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:26:45,721 INFO L87 Difference]: Start difference. First operand 96 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:46,351 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-11-10 03:26:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:26:46,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-10 03:26:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:46,354 INFO L225 Difference]: With dead ends: 239 [2024-11-10 03:26:46,354 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 03:26:46,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:26:46,355 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 40 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:46,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 345 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:26:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 03:26:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2024-11-10 03:26:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:26:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-10 03:26:46,362 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 167 [2024-11-10 03:26:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:46,363 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-10 03:26:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-10 03:26:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 03:26:46,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:46,364 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:46,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:26:46,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1382401436, now seen corresponding path program 1 times [2024-11-10 03:26:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240047955] [2024-11-10 03:26:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:47,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:26:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:26:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:26:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:26:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:26:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:26:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:26:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:26:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:26:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:26:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:26:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:26:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:26:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:26:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:26:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:26:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:26:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:26:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:26:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:26:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:26:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:26:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:26:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:26:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:26:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:26:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:26:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:26:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240047955] [2024-11-10 03:26:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240047955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:26:48,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:26:48,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:26:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499673438] [2024-11-10 03:26:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:26:48,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:26:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:26:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:26:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:26:48,039 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:49,325 INFO L93 Difference]: Finished difference Result 261 states and 397 transitions. [2024-11-10 03:26:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:26:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-11-10 03:26:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:49,328 INFO L225 Difference]: With dead ends: 261 [2024-11-10 03:26:49,328 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 03:26:49,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:26:49,329 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 88 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:49,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 284 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 03:26:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 03:26:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 82. [2024-11-10 03:26:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:26:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-10 03:26:49,335 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 167 [2024-11-10 03:26:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:49,336 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-10 03:26:49,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-10 03:26:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 03:26:49,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:49,338 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:49,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:26:49,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:49,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash 87126349, now seen corresponding path program 1 times [2024-11-10 03:26:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:49,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593075280] [2024-11-10 03:26:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:26:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:26:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:26:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:26:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:26:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:26:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:26:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:26:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:26:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:26:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:26:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:26:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:26:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:26:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:26:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:26:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:26:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:26:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:26:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:26:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:26:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:26:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:26:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:26:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:26:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:26:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:26:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:26:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593075280] [2024-11-10 03:26:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593075280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:26:51,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:26:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:26:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659500629] [2024-11-10 03:26:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:26:51,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:26:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:26:51,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:26:51,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:26:51,589 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:52,226 INFO L93 Difference]: Finished difference Result 317 states and 467 transitions. [2024-11-10 03:26:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:26:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-10 03:26:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:52,231 INFO L225 Difference]: With dead ends: 317 [2024-11-10 03:26:52,231 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 03:26:52,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:26:52,232 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 221 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:52,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 565 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:26:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 03:26:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 227. [2024-11-10 03:26:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 166 states have internal predecessors, (221), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 03:26:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 337 transitions. [2024-11-10 03:26:52,269 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 337 transitions. Word has length 168 [2024-11-10 03:26:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:52,269 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 337 transitions. [2024-11-10 03:26:52,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 337 transitions. [2024-11-10 03:26:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-10 03:26:52,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:52,271 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:52,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:26:52,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:52,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:52,271 INFO L85 PathProgramCache]: Analyzing trace with hash -423407828, now seen corresponding path program 1 times [2024-11-10 03:26:52,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:52,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333265365] [2024-11-10 03:26:52,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:52,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:26:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:26:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:26:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:26:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:26:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:26:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:26:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:26:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:26:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:26:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:26:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:26:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:26:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:26:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:26:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:26:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:26:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:26:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:26:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:26:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:26:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:26:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:26:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:26:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:26:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:26:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:26:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:26:53,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:26:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333265365] [2024-11-10 03:26:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333265365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:26:53,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:26:53,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:26:53,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612719551] [2024-11-10 03:26:53,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:26:53,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:26:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:26:53,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:26:53,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:26:53,793 INFO L87 Difference]: Start difference. First operand 227 states and 337 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:26:54,439 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2024-11-10 03:26:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:26:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-11-10 03:26:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:26:54,444 INFO L225 Difference]: With dead ends: 474 [2024-11-10 03:26:54,444 INFO L226 Difference]: Without dead ends: 250 [2024-11-10 03:26:54,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:26:54,445 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 187 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:26:54,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 606 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:26:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-10 03:26:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 205. [2024-11-10 03:26:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 144 states have internal predecessors, (189), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 03:26:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2024-11-10 03:26:54,462 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 168 [2024-11-10 03:26:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:26:54,462 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2024-11-10 03:26:54,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:26:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2024-11-10 03:26:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 03:26:54,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:26:54,464 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:26:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:26:54,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:26:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:26:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1618374372, now seen corresponding path program 1 times [2024-11-10 03:26:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:26:54,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597706100] [2024-11-10 03:26:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:26:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:26:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:27:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:27:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:27:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:27:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:27:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:27:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:27:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:27:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:27:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:27:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:27:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:27:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:27:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:27:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:27:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:27:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:27:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:27:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:27:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:27:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:27:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:27:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:27:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:27:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:27:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:27:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:27:01,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:27:01,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597706100] [2024-11-10 03:27:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597706100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:27:01,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:27:01,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 03:27:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783066427] [2024-11-10 03:27:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:27:01,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 03:27:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:27:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 03:27:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:27:01,630 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:27:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:27:05,689 INFO L93 Difference]: Finished difference Result 507 states and 731 transitions. [2024-11-10 03:27:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:27:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-10 03:27:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:27:05,694 INFO L225 Difference]: With dead ends: 507 [2024-11-10 03:27:05,694 INFO L226 Difference]: Without dead ends: 428 [2024-11-10 03:27:05,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-10 03:27:05,696 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 397 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:27:05,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 634 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 03:27:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-10 03:27:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 415. [2024-11-10 03:27:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 321 states have (on average 1.355140186915888) internal successors, (435), 328 states have internal predecessors, (435), 82 states have call successors, (82), 11 states have call predecessors, (82), 11 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-10 03:27:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 599 transitions. [2024-11-10 03:27:05,733 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 599 transitions. Word has length 169 [2024-11-10 03:27:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:27:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 599 transitions. [2024-11-10 03:27:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:27:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 599 transitions. [2024-11-10 03:27:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 03:27:05,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:27:05,735 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:27:05,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:27:05,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:27:05,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:27:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 973848244, now seen corresponding path program 1 times [2024-11-10 03:27:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:27:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305564564] [2024-11-10 03:27:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:27:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:27:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:27:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:27:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:27:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:27:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:27:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:27:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:27:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:27:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:27:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:27:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:27:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:27:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:27:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:27:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:27:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:27:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:27:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:27:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:27:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:27:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:27:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:27:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:27:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:27:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:27:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:27:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:27:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:27:05,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305564564] [2024-11-10 03:27:05,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305564564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:27:05,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:27:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:27:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919446031] [2024-11-10 03:27:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:27:05,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:27:05,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:27:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:27:05,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:27:05,914 INFO L87 Difference]: Start difference. First operand 415 states and 599 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:27:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:27:06,021 INFO L93 Difference]: Finished difference Result 827 states and 1194 transitions. [2024-11-10 03:27:06,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:27:06,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-10 03:27:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:27:06,024 INFO L225 Difference]: With dead ends: 827 [2024-11-10 03:27:06,024 INFO L226 Difference]: Without dead ends: 420 [2024-11-10 03:27:06,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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-10 03:27:06,027 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 77 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:27:06,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 290 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:27:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-10 03:27:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2024-11-10 03:27:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 323 states have (on average 1.3529411764705883) internal successors, (437), 330 states have internal predecessors, (437), 82 states have call successors, (82), 11 states have call predecessors, (82), 11 states have return successors, (82), 75 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-10 03:27:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 601 transitions. [2024-11-10 03:27:06,061 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 601 transitions. Word has length 169 [2024-11-10 03:27:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:27:06,061 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 601 transitions. [2024-11-10 03:27:06,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:27:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 601 transitions. [2024-11-10 03:27:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 03:27:06,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:27:06,064 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:27:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:27:06,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:27:06,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:27:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash 994247887, now seen corresponding path program 1 times [2024-11-10 03:27:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:27:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99581907] [2024-11-10 03:27:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:27:06,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:27:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:27:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:27:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:27:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:27:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:27:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:27:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:27:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:27:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:27:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:27:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:27:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:27:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:27:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:27:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:27:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:27:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:27:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:27:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:27:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:27:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:27:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:27:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:27:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:27:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:27:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:27:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:27:06,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:27:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99581907] [2024-11-10 03:27:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99581907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:27:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:27:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:27:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461709877] [2024-11-10 03:27:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:27:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:27:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:27:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:27:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:27:06,148 INFO L87 Difference]: Start difference. First operand 417 states and 601 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:27:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:27:06,254 INFO L93 Difference]: Finished difference Result 1086 states and 1543 transitions. [2024-11-10 03:27:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:27:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-10 03:27:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:27:06,258 INFO L225 Difference]: With dead ends: 1086 [2024-11-10 03:27:06,258 INFO L226 Difference]: Without dead ends: 677 [2024-11-10 03:27:06,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:27:06,260 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:27:06,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 200 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:27:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-10 03:27:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 553. [2024-11-10 03:27:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 443 states have (on average 1.3589164785553047) internal successors, (602), 453 states have internal predecessors, (602), 94 states have call successors, (94), 15 states have call predecessors, (94), 15 states have return successors, (94), 84 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-10 03:27:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 790 transitions. [2024-11-10 03:27:06,298 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 790 transitions. Word has length 169 [2024-11-10 03:27:06,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:27:06,299 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 790 transitions. [2024-11-10 03:27:06,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:27:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 790 transitions. [2024-11-10 03:27:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 03:27:06,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:27:06,301 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:27:06,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 03:27:06,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:27:06,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:27:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash -357066555, now seen corresponding path program 1 times [2024-11-10 03:27:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:27:06,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794911163] [2024-11-10 03:27:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:27:06,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:27:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:27:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:27:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:27:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:27:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:27:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:27:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:27:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:27:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:27:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:27:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:27:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:27:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:27:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 03:27:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:27:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 03:27:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:27:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 03:27:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 03:27:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 03:27:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 03:27:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 03:27:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:27:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 03:27:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:27:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-10 03:27:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 03:27:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:27:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794911163] [2024-11-10 03:27:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794911163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:27:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:27:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:27:06,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100610090] [2024-11-10 03:27:06,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:27:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:27:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:27:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:27:06,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:27:06,454 INFO L87 Difference]: Start difference. First operand 553 states and 790 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:27:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:27:06,559 INFO L93 Difference]: Finished difference Result 813 states and 1168 transitions. [2024-11-10 03:27:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:27:06,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-10 03:27:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:27:06,564 INFO L225 Difference]: With dead ends: 813 [2024-11-10 03:27:06,564 INFO L226 Difference]: Without dead ends: 551 [2024-11-10 03:27:06,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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-10 03:27:06,565 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 122 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:27:06,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 175 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:27:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-10 03:27:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2024-11-10 03:27:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 441 states have (on average 1.3492063492063493) internal successors, (595), 451 states have internal predecessors, (595), 94 states have call successors, (94), 15 states have call predecessors, (94), 15 states have return successors, (94), 84 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-10 03:27:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 783 transitions. [2024-11-10 03:27:06,604 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 783 transitions. Word has length 170 [2024-11-10 03:27:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:27:06,605 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 783 transitions. [2024-11-10 03:27:06,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 03:27:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 783 transitions. [2024-11-10 03:27:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 03:27:06,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:27:06,606 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:27:06,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 03:27:06,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:27:06,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:27:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2019501745, now seen corresponding path program 1 times [2024-11-10 03:27:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:27:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421982251] [2024-11-10 03:27:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:27:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:27:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:27:06,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879956015] [2024-11-10 03:27:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:27:06,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:27:06,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:27:06,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:27:06,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:27:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:27:06,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:27:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:27:06,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:27:06,937 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:27:06,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:27:06,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:27:07,140 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,SelfDestructingSolverStorable11 [2024-11-10 03:27:07,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:27:07,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:27:07,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:27:07 BoogieIcfgContainer [2024-11-10 03:27:07,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:27:07,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:27:07,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:27:07,225 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:27:07,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:26:38" (3/4) ... [2024-11-10 03:27:07,227 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:27:07,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:27:07,228 INFO L158 Benchmark]: Toolchain (without parser) took 29189.27ms. Allocated memory was 159.4MB in the beginning and 671.1MB in the end (delta: 511.7MB). Free memory was 85.7MB in the beginning and 340.8MB in the end (delta: -255.1MB). Peak memory consumption was 258.0MB. Max. memory is 16.1GB. [2024-11-10 03:27:07,228 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:27:07,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.45ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 69.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:27:07,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.06ms. Allocated memory is still 159.4MB. Free memory was 69.6MB in the beginning and 127.8MB in the end (delta: -58.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-10 03:27:07,229 INFO L158 Benchmark]: Boogie Preprocessor took 79.67ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 127.7MB in the beginning and 182.5MB in the end (delta: -54.7MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-10 03:27:07,229 INFO L158 Benchmark]: IcfgBuilder took 494.34ms. Allocated memory is still 216.0MB. Free memory was 182.5MB in the beginning and 153.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 03:27:07,229 INFO L158 Benchmark]: TraceAbstraction took 28256.64ms. Allocated memory was 216.0MB in the beginning and 671.1MB in the end (delta: 455.1MB). Free memory was 152.1MB in the beginning and 340.8MB in the end (delta: -188.7MB). Peak memory consumption was 266.4MB. Max. memory is 16.1GB. [2024-11-10 03:27:07,229 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 671.1MB. Free memory is still 340.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:27:07,230 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.45ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 69.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.06ms. Allocated memory is still 159.4MB. Free memory was 69.6MB in the beginning and 127.8MB in the end (delta: -58.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.67ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 127.7MB in the beginning and 182.5MB in the end (delta: -54.7MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * IcfgBuilder took 494.34ms. Allocated memory is still 216.0MB. Free memory was 182.5MB in the beginning and 153.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28256.64ms. Allocated memory was 216.0MB in the beginning and 671.1MB in the end (delta: 455.1MB). Free memory was 152.1MB in the beginning and 340.8MB in the end (delta: -188.7MB). Peak memory consumption was 266.4MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 671.1MB. Free memory is still 340.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 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = -16; [L25] signed char var_1_4 = 50; [L26] signed char var_1_5 = 4; [L27] unsigned long int var_1_6 = 50; [L28] signed long int var_1_7 = -8; [L29] signed long int var_1_8 = -4; [L30] signed char var_1_9 = 50; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 5; [L33] unsigned long int var_1_12 = 10; [L34] signed char var_1_13 = 16; [L35] signed long int var_1_14 = 1; [L36] unsigned short int var_1_15 = 128; [L37] signed long int var_1_16 = 2; [L38] unsigned short int var_1_17 = 61498; [L39] unsigned long int var_1_18 = 1; [L40] unsigned char var_1_19 = 0; [L41] double var_1_20 = 4.9; [L42] double var_1_21 = 1.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L106] var_1_14 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L108] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L109] var_1_16 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L110] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L112] var_1_17 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L113] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L114] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L114] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L115] var_1_21 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L116] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L129] RET updateVariables() [L130] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L49] COND FALSE !(-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L54] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L54] COND FALSE !(var_1_6 <= (var_1_8 & var_1_4)) [L59] var_1_9 = var_1_4 VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L61] COND TRUE var_1_3 <= var_1_1 [L62] var_1_12 = var_1_4 VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L66] COND TRUE (~ var_1_3) < var_1_14 [L67] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L69] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L69] COND TRUE ((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L70] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L74] var_1_18 = var_1_17 [L75] var_1_19 = 0 [L76] var_1_20 = var_1_21 VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L121] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L121] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L121] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L121] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L121] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L121-L122] return ((((((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=257, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1377 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1377 mSDsluCounter, 3873 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2573 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3353 IncrementalHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1300 mSDtfsCounter, 3353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=10, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 419 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 2186 NumberOfCodeBlocks, 2186 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1835 ConstructedInterpolants, 0 QuantifiedInterpolants, 12242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14300/14300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:27:07,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.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 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:27:09,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:27:09,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:27:09,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:27:09,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:27:09,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:27:09,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:27:09,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:27:09,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:27:09,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:27:09,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:27:09,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:27:09,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:27:09,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:27:09,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:27:09,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:27:09,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:27:09,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:27:09,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:27:09,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:27:09,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:27:09,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:27:09,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:27:09,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:27:09,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:27:09,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:27:09,138 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:27:09,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:27:09,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:27:09,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:27:09,140 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:27:09,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:27:09,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:27:09,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:27:09,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:27:09,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:27:09,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:27:09,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:27:09,142 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:27:09,142 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:27:09,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:27:09,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:27:09,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:27:09,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:27:09,144 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 -> 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f [2024-11-10 03:27:09,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:27:09,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:27:09,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:27:09,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:27:09,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:27:09,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-11-10 03:27:10,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:27:10,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:27:10,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2024-11-10 03:27:10,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73069b4e6/c2e61bfb266f40449ece47851d0d5530/FLAG11112cde4 [2024-11-10 03:27:10,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73069b4e6/c2e61bfb266f40449ece47851d0d5530 [2024-11-10 03:27:10,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:27:10,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:27:10,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:27:10,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:27:10,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:27:10,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:27:10" (1/1) ... [2024-11-10 03:27:10,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328e67da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:10, skipping insertion in model container [2024-11-10 03:27:10,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:27:10" (1/1) ... [2024-11-10 03:27:10,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:27:11,011 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_codestructure_normal_file-84.i[913,926] [2024-11-10 03:27:11,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:27:11,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:27:11,105 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_codestructure_normal_file-84.i[913,926] [2024-11-10 03:27:11,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:27:11,160 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:27:11,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11 WrapperNode [2024-11-10 03:27:11,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:27:11,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:27:11,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:27:11,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:27:11,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,212 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-10 03:27:11,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:27:11,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:27:11,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:27:11,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:27:11,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,269 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:27:11,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:27:11,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:27:11,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:27:11,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:27:11,292 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (1/1) ... [2024-11-10 03:27:11,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:27:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:27:11,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:27:11,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:27:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:27:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:27:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:27:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:27:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:27:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:27:11,441 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:27:11,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:27:11,811 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:27:11,812 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:27:11,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:27:11,828 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:27:11,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:27:11 BoogieIcfgContainer [2024-11-10 03:27:11,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:27:11,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:27:11,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:27:11,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:27:11,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:27:10" (1/3) ... [2024-11-10 03:27:11,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c51ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:27:11, skipping insertion in model container [2024-11-10 03:27:11,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:27:11" (2/3) ... [2024-11-10 03:27:11,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c51ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:27:11, skipping insertion in model container [2024-11-10 03:27:11,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:27:11" (3/3) ... [2024-11-10 03:27:11,836 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-84.i [2024-11-10 03:27:11,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:27:11,851 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:27:11,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:27:11,929 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;@582e5be5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:27:11,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:27:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:27:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 03:27:11,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:27:11,947 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:27:11,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:27:11,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:27:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1900494751, now seen corresponding path program 1 times [2024-11-10 03:27:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:27:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178330743] [2024-11-10 03:27:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:27:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:27:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:27:11,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:27:11,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:27:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:12,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:27:12,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:27:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-10 03:27:12,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:27:12,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:27:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178330743] [2024-11-10 03:27:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178330743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:27:12,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:27:12,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:27:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077010725] [2024-11-10 03:27:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:27:12,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:27:12,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:27:12,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:27:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:27:12,249 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:27:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:27:12,275 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2024-11-10 03:27:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:27:12,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-11-10 03:27:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:27:12,291 INFO L225 Difference]: With dead ends: 130 [2024-11-10 03:27:12,292 INFO L226 Difference]: Without dead ends: 64 [2024-11-10 03:27:12,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:27:12,299 INFO L432 NwaCegarLoop]: 97 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, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:27:12,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:27:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-10 03:27:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-10 03:27:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 03:27:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2024-11-10 03:27:12,344 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 160 [2024-11-10 03:27:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:27:12,344 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2024-11-10 03:27:12,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 03:27:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2024-11-10 03:27:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 03:27:12,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:27:12,349 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:27:12,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:27:12,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:27:12,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:27:12,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:27:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1361362333, now seen corresponding path program 1 times [2024-11-10 03:27:12,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:27:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872713877] [2024-11-10 03:27:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:27:12,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:27:12,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:27:12,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:27:12,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:27:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:27:12,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 03:27:12,764 INFO L278 TraceCheckSpWp]: Computing forward predicates...