./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:19:46,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:19:46,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:19:46,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:19:46,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:19:47,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:19:47,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:19:47,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:19:47,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:19:47,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:19:47,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:19:47,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:19:47,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:19:47,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:19:47,026 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:19:47,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:19:47,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:19:47,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:19:47,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:19:47,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:19:47,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:19:47,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:19:47,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:19:47,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:19:47,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:19:47,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:19:47,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:19:47,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:19:47,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:19:47,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:19:47,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:19:47,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:19:47,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:19:47,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:19:47,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:19:47,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:19:47,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:19:47,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:19:47,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:19:47,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:19:47,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:19:47,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:19:47,057 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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2024-10-24 07:19:47,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:19:47,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:19:47,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:19:47,332 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:19:47,332 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:19:47,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-10-24 07:19:48,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:19:48,967 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:19:48,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-10-24 07:19:48,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3060fe6/35a2eb48c82a4275bb8acf9e5344f244/FLAGc918c9914 [2024-10-24 07:19:48,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3060fe6/35a2eb48c82a4275bb8acf9e5344f244 [2024-10-24 07:19:48,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:19:48,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:19:48,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:19:48,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:19:49,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:19:49,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:19:48" (1/1) ... [2024-10-24 07:19:49,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515b0133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49, skipping insertion in model container [2024-10-24 07:19:49,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:19:48" (1/1) ... [2024-10-24 07:19:49,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:19:49,203 WARN L248 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_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2024-10-24 07:19:49,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:19:49,304 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:19:49,313 WARN L248 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_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2024-10-24 07:19:49,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:19:49,390 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:19:49,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49 WrapperNode [2024-10-24 07:19:49,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:19:49,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:19:49,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:19:49,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:19:49,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,470 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 285 [2024-10-24 07:19:49,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:19:49,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:19:49,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:19:49,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:19:49,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,515 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-10-24 07:19:49,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:19:49,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:19:49,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:19:49,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:19:49,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (1/1) ... [2024-10-24 07:19:49,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:19:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:19:49,591 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-10-24 07:19:49,597 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-10-24 07:19:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:19:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:19:49,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:19:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:19:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:19:49,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:19:49,754 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:19:49,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:19:50,278 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-24 07:19:50,278 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:19:50,331 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:19:50,332 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:19:50,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:19:50 BoogieIcfgContainer [2024-10-24 07:19:50,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:19:50,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:19:50,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:19:50,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:19:50,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:19:48" (1/3) ... [2024-10-24 07:19:50,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217db49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:19:50, skipping insertion in model container [2024-10-24 07:19:50,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:19:49" (2/3) ... [2024-10-24 07:19:50,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217db49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:19:50, skipping insertion in model container [2024-10-24 07:19:50,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:19:50" (3/3) ... [2024-10-24 07:19:50,343 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-10-24 07:19:50,360 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:19:50,361 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:19:50,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:19:50,438 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;@50e649a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:19:50,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:19:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:19:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 07:19:50,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:50,457 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:50,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:50,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1082683529, now seen corresponding path program 1 times [2024-10-24 07:19:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:50,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137549202] [2024-10-24 07:19:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:50,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:50,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:51,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137549202] [2024-10-24 07:19:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137549202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:19:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329073508] [2024-10-24 07:19:51,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:51,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:19:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:19:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:19:51,095 INFO L87 Difference]: Start difference. First operand has 109 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:19:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:51,145 INFO L93 Difference]: Finished difference Result 215 states and 376 transitions. [2024-10-24 07:19:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:19:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 211 [2024-10-24 07:19:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:51,161 INFO L225 Difference]: With dead ends: 215 [2024-10-24 07:19:51,163 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 07:19:51,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-10-24 07:19:51,174 INFO L432 NwaCegarLoop]: 164 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, 164 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-10-24 07:19:51,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:19:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 07:19:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-24 07:19:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:19:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-10-24 07:19:51,247 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 211 [2024-10-24 07:19:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-10-24 07:19:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 07:19:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-10-24 07:19:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 07:19:51,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:51,253 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:19:51,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1667172573, now seen corresponding path program 1 times [2024-10-24 07:19:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862908076] [2024-10-24 07:19:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:51,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862908076] [2024-10-24 07:19:51,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862908076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:51,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:51,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:19:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536345211] [2024-10-24 07:19:51,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:51,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:19:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:19:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:19:51,718 INFO L87 Difference]: Start difference. First operand 107 states and 168 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:51,827 INFO L93 Difference]: Finished difference Result 258 states and 407 transitions. [2024-10-24 07:19:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:19:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-10-24 07:19:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:51,832 INFO L225 Difference]: With dead ends: 258 [2024-10-24 07:19:51,835 INFO L226 Difference]: Without dead ends: 152 [2024-10-24 07:19:51,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-10-24 07:19:51,839 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 68 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:19:51,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 314 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:19:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-24 07:19:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120. [2024-10-24 07:19:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:19:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 187 transitions. [2024-10-24 07:19:51,865 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 187 transitions. Word has length 211 [2024-10-24 07:19:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:51,868 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 187 transitions. [2024-10-24 07:19:51,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 187 transitions. [2024-10-24 07:19:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 07:19:51,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:51,875 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:51,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:19:51,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:51,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1526623963, now seen corresponding path program 1 times [2024-10-24 07:19:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:51,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762451127] [2024-10-24 07:19:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:53,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:53,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762451127] [2024-10-24 07:19:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762451127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 07:19:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049928957] [2024-10-24 07:19:53,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:53,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 07:19:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 07:19:53,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:19:53,166 INFO L87 Difference]: Start difference. First operand 120 states and 187 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:54,378 INFO L93 Difference]: Finished difference Result 495 states and 770 transitions. [2024-10-24 07:19:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 07:19:54,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-10-24 07:19:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:54,382 INFO L225 Difference]: With dead ends: 495 [2024-10-24 07:19:54,382 INFO L226 Difference]: Without dead ends: 376 [2024-10-24 07:19:54,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-24 07:19:54,384 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 746 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:19:54,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1292 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 07:19:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-24 07:19:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 176. [2024-10-24 07:19:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:19:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 278 transitions. [2024-10-24 07:19:54,406 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 278 transitions. Word has length 211 [2024-10-24 07:19:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:54,407 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 278 transitions. [2024-10-24 07:19:54,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 278 transitions. [2024-10-24 07:19:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 07:19:54,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:54,410 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:54,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:19:54,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:54,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1103922137, now seen corresponding path program 1 times [2024-10-24 07:19:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:54,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635070243] [2024-10-24 07:19:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635070243] [2024-10-24 07:19:54,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635070243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:54,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:54,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:19:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034582056] [2024-10-24 07:19:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:54,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:19:54,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:54,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:19:54,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:19:54,710 INFO L87 Difference]: Start difference. First operand 176 states and 278 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:54,913 INFO L93 Difference]: Finished difference Result 671 states and 1062 transitions. [2024-10-24 07:19:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:19:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-10-24 07:19:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:54,917 INFO L225 Difference]: With dead ends: 671 [2024-10-24 07:19:54,917 INFO L226 Difference]: Without dead ends: 496 [2024-10-24 07:19:54,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:19:54,919 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 277 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:19:54,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 818 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:19:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-24 07:19:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 336. [2024-10-24 07:19:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 269 states have (on average 1.4907063197026023) internal successors, (401), 269 states have internal predecessors, (401), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:19:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 529 transitions. [2024-10-24 07:19:54,951 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 529 transitions. Word has length 211 [2024-10-24 07:19:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:54,952 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 529 transitions. [2024-10-24 07:19:54,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 529 transitions. [2024-10-24 07:19:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 07:19:54,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:54,954 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:54,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:19:54,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:54,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1729212187, now seen corresponding path program 1 times [2024-10-24 07:19:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272271983] [2024-10-24 07:19:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:55,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272271983] [2024-10-24 07:19:55,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272271983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:55,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:55,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:19:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977520684] [2024-10-24 07:19:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:55,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:19:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:19:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:19:55,094 INFO L87 Difference]: Start difference. First operand 336 states and 529 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:55,133 INFO L93 Difference]: Finished difference Result 729 states and 1148 transitions. [2024-10-24 07:19:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:19:55,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-10-24 07:19:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:55,136 INFO L225 Difference]: With dead ends: 729 [2024-10-24 07:19:55,136 INFO L226 Difference]: Without dead ends: 394 [2024-10-24 07:19:55,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-10-24 07:19:55,138 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 62 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:19:55,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 375 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:19:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-24 07:19:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 336. [2024-10-24 07:19:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 269 states have (on average 1.4646840148698885) internal successors, (394), 269 states have internal predecessors, (394), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:19:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 522 transitions. [2024-10-24 07:19:55,162 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 522 transitions. Word has length 211 [2024-10-24 07:19:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:55,162 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 522 transitions. [2024-10-24 07:19:55,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 522 transitions. [2024-10-24 07:19:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 07:19:55,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:55,165 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 07:19:55,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash 208390839, now seen corresponding path program 1 times [2024-10-24 07:19:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116186327] [2024-10-24 07:19:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116186327] [2024-10-24 07:19:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116186327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:55,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:19:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52265396] [2024-10-24 07:19:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:55,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:19:55,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:19:55,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:19:55,373 INFO L87 Difference]: Start difference. First operand 336 states and 522 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:55,459 INFO L93 Difference]: Finished difference Result 929 states and 1439 transitions. [2024-10-24 07:19:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:19:55,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-10-24 07:19:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:55,465 INFO L225 Difference]: With dead ends: 929 [2024-10-24 07:19:55,466 INFO L226 Difference]: Without dead ends: 594 [2024-10-24 07:19:55,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-10-24 07:19:55,467 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 136 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:19:55,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:19:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-10-24 07:19:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 448. [2024-10-24 07:19:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 381 states have (on average 1.4934383202099737) internal successors, (569), 381 states have internal predecessors, (569), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:19:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 697 transitions. [2024-10-24 07:19:55,509 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 697 transitions. Word has length 212 [2024-10-24 07:19:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:55,510 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 697 transitions. [2024-10-24 07:19:55,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 697 transitions. [2024-10-24 07:19:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 07:19:55,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:55,513 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:55,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 07:19:55,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:55,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1372810716, now seen corresponding path program 1 times [2024-10-24 07:19:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381739771] [2024-10-24 07:19:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:55,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381739771] [2024-10-24 07:19:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381739771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:19:55,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023100544] [2024-10-24 07:19:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:55,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:19:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:19:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:19:55,996 INFO L87 Difference]: Start difference. First operand 448 states and 697 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:56,451 INFO L93 Difference]: Finished difference Result 1076 states and 1687 transitions. [2024-10-24 07:19:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:19:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-10-24 07:19:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:56,456 INFO L225 Difference]: With dead ends: 1076 [2024-10-24 07:19:56,456 INFO L226 Difference]: Without dead ends: 629 [2024-10-24 07:19:56,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:19:56,458 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 313 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:19:56,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 377 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 07:19:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-24 07:19:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2024-10-24 07:19:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 336 states have (on average 1.4702380952380953) internal successors, (494), 336 states have internal predecessors, (494), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:19:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 622 transitions. [2024-10-24 07:19:56,494 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 622 transitions. Word has length 212 [2024-10-24 07:19:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:56,495 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 622 transitions. [2024-10-24 07:19:56,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 622 transitions. [2024-10-24 07:19:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 07:19:56,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:56,498 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 07:19:56,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash 473846225, now seen corresponding path program 1 times [2024-10-24 07:19:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:56,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737608100] [2024-10-24 07:19:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:57,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737608100] [2024-10-24 07:19:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737608100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:57,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:57,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 07:19:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581623249] [2024-10-24 07:19:57,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:57,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:19:57,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:57,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:19:57,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:19:57,044 INFO L87 Difference]: Start difference. First operand 403 states and 622 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:19:58,034 INFO L93 Difference]: Finished difference Result 960 states and 1470 transitions. [2024-10-24 07:19:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:19:58,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-10-24 07:19:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:19:58,039 INFO L225 Difference]: With dead ends: 960 [2024-10-24 07:19:58,039 INFO L226 Difference]: Without dead ends: 745 [2024-10-24 07:19:58,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:19:58,040 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 601 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:19:58,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 688 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 07:19:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-10-24 07:19:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 408. [2024-10-24 07:19:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 341 states have (on average 1.466275659824047) internal successors, (500), 341 states have internal predecessors, (500), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:19:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 628 transitions. [2024-10-24 07:19:58,100 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 628 transitions. Word has length 212 [2024-10-24 07:19:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:19:58,101 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 628 transitions. [2024-10-24 07:19:58,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:19:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 628 transitions. [2024-10-24 07:19:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 07:19:58,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:19:58,103 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:19:58,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 07:19:58,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:19:58,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:19:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash 898157461, now seen corresponding path program 1 times [2024-10-24 07:19:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:19:58,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289021315] [2024-10-24 07:19:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:19:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:19:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:19:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:19:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:19:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:19:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:19:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:19:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:19:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:19:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:19:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:19:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:19:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:19:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:19:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:19:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:19:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:19:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:19:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:19:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:19:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:19:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:19:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:19:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:19:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:19:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:19:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:19:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:19:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:19:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:19:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:19:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:19:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:19:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:19:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:19:59,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:19:59,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289021315] [2024-10-24 07:19:59,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289021315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:19:59,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:19:59,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 07:19:59,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680985672] [2024-10-24 07:19:59,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:19:59,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 07:19:59,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:19:59,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 07:19:59,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:19:59,432 INFO L87 Difference]: Start difference. First operand 408 states and 628 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:00,168 INFO L93 Difference]: Finished difference Result 919 states and 1415 transitions. [2024-10-24 07:20:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 07:20:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-10-24 07:20:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:00,173 INFO L225 Difference]: With dead ends: 919 [2024-10-24 07:20:00,173 INFO L226 Difference]: Without dead ends: 703 [2024-10-24 07:20:00,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2024-10-24 07:20:00,174 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 299 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:00,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1183 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 07:20:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-10-24 07:20:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 433. [2024-10-24 07:20:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 366 states have (on average 1.469945355191257) internal successors, (538), 366 states have internal predecessors, (538), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:20:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 666 transitions. [2024-10-24 07:20:00,227 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 666 transitions. Word has length 212 [2024-10-24 07:20:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:00,228 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 666 transitions. [2024-10-24 07:20:00,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 666 transitions. [2024-10-24 07:20:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 07:20:00,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:00,230 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:00,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 07:20:00,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:00,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash -912963628, now seen corresponding path program 1 times [2024-10-24 07:20:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:00,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533488925] [2024-10-24 07:20:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:00,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533488925] [2024-10-24 07:20:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533488925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:20:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682972211] [2024-10-24 07:20:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:00,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:20:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:20:00,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:20:00,661 INFO L87 Difference]: Start difference. First operand 433 states and 666 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:01,142 INFO L93 Difference]: Finished difference Result 1097 states and 1690 transitions. [2024-10-24 07:20:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:20:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-10-24 07:20:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:01,147 INFO L225 Difference]: With dead ends: 1097 [2024-10-24 07:20:01,147 INFO L226 Difference]: Without dead ends: 663 [2024-10-24 07:20:01,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:20:01,149 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 136 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:01,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1057 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:20:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-10-24 07:20:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 515. [2024-10-24 07:20:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 448 states have (on average 1.4955357142857142) internal successors, (670), 448 states have internal predecessors, (670), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:20:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 798 transitions. [2024-10-24 07:20:01,231 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 798 transitions. Word has length 212 [2024-10-24 07:20:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:01,232 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 798 transitions. [2024-10-24 07:20:01,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 798 transitions. [2024-10-24 07:20:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:20:01,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:01,235 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 07:20:01,235 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -512736954, now seen corresponding path program 1 times [2024-10-24 07:20:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340890942] [2024-10-24 07:20:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340890942] [2024-10-24 07:20:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340890942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:01,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 07:20:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691877833] [2024-10-24 07:20:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:01,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:20:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:20:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:20:01,520 INFO L87 Difference]: Start difference. First operand 515 states and 798 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:02,375 INFO L93 Difference]: Finished difference Result 1093 states and 1676 transitions. [2024-10-24 07:20:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:20:02,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-10-24 07:20:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:02,381 INFO L225 Difference]: With dead ends: 1093 [2024-10-24 07:20:02,381 INFO L226 Difference]: Without dead ends: 809 [2024-10-24 07:20:02,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:20:02,384 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 453 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:02,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1170 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 07:20:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-10-24 07:20:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 526. [2024-10-24 07:20:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 459 states have (on average 1.4923747276688453) internal successors, (685), 459 states have internal predecessors, (685), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:20:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 813 transitions. [2024-10-24 07:20:02,500 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 813 transitions. Word has length 213 [2024-10-24 07:20:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:02,501 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 813 transitions. [2024-10-24 07:20:02,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 813 transitions. [2024-10-24 07:20:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:20:02,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:02,505 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:02,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 07:20:02,506 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:02,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash 767126724, now seen corresponding path program 1 times [2024-10-24 07:20:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:02,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808462335] [2024-10-24 07:20:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808462335] [2024-10-24 07:20:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808462335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:03,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:03,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 07:20:03,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994267862] [2024-10-24 07:20:03,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:03,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 07:20:03,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:03,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 07:20:03,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:20:03,740 INFO L87 Difference]: Start difference. First operand 526 states and 813 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:04,235 INFO L93 Difference]: Finished difference Result 1244 states and 1913 transitions. [2024-10-24 07:20:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:20:04,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-10-24 07:20:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:04,240 INFO L225 Difference]: With dead ends: 1244 [2024-10-24 07:20:04,240 INFO L226 Difference]: Without dead ends: 949 [2024-10-24 07:20:04,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:20:04,242 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 161 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:04,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 663 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:20:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-10-24 07:20:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 945. [2024-10-24 07:20:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 872 states have (on average 1.5137614678899083) internal successors, (1320), 874 states have internal predecessors, (1320), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 07:20:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1456 transitions. [2024-10-24 07:20:04,326 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1456 transitions. Word has length 213 [2024-10-24 07:20:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:04,327 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1456 transitions. [2024-10-24 07:20:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1456 transitions. [2024-10-24 07:20:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:20:04,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:04,330 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:04,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 07:20:04,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:04,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash 633113218, now seen corresponding path program 1 times [2024-10-24 07:20:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:04,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572861133] [2024-10-24 07:20:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:04,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572861133] [2024-10-24 07:20:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572861133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:05,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:05,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 07:20:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336836720] [2024-10-24 07:20:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:05,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:20:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:05,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:20:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:20:05,053 INFO L87 Difference]: Start difference. First operand 945 states and 1456 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:05,561 INFO L93 Difference]: Finished difference Result 3463 states and 5360 transitions. [2024-10-24 07:20:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:20:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-10-24 07:20:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:05,574 INFO L225 Difference]: With dead ends: 3463 [2024-10-24 07:20:05,574 INFO L226 Difference]: Without dead ends: 2519 [2024-10-24 07:20:05,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:20:05,578 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 489 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:05,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 723 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:20:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2024-10-24 07:20:05,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1919. [2024-10-24 07:20:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1774 states have (on average 1.5073280721533258) internal successors, (2674), 1778 states have internal predecessors, (2674), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2946 transitions. [2024-10-24 07:20:05,739 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 2946 transitions. Word has length 213 [2024-10-24 07:20:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:05,740 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 2946 transitions. [2024-10-24 07:20:05,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2946 transitions. [2024-10-24 07:20:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:20:05,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:05,745 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:05,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 07:20:05,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:05,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash -738821658, now seen corresponding path program 1 times [2024-10-24 07:20:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434664812] [2024-10-24 07:20:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:05,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:05,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:05,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434664812] [2024-10-24 07:20:05,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434664812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:05,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:05,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:20:05,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347739785] [2024-10-24 07:20:05,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:05,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:20:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:20:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:20:05,927 INFO L87 Difference]: Start difference. First operand 1919 states and 2946 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:06,241 INFO L93 Difference]: Finished difference Result 4187 states and 6404 transitions. [2024-10-24 07:20:06,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:20:06,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-10-24 07:20:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:06,253 INFO L225 Difference]: With dead ends: 4187 [2024-10-24 07:20:06,254 INFO L226 Difference]: Without dead ends: 2269 [2024-10-24 07:20:06,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-10-24 07:20:06,258 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 131 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:06,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 414 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:20:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2024-10-24 07:20:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1875. [2024-10-24 07:20:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1730 states have (on average 1.4947976878612717) internal successors, (2586), 1734 states have internal predecessors, (2586), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2858 transitions. [2024-10-24 07:20:06,437 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2858 transitions. Word has length 213 [2024-10-24 07:20:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:06,437 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 2858 transitions. [2024-10-24 07:20:06,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2858 transitions. [2024-10-24 07:20:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:20:06,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:06,442 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:06,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 07:20:06,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:06,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1757942416, now seen corresponding path program 1 times [2024-10-24 07:20:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:06,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064753397] [2024-10-24 07:20:06,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:06,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:06,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064753397] [2024-10-24 07:20:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064753397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:06,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:20:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371824266] [2024-10-24 07:20:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:06,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:20:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:06,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:20:06,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:20:06,905 INFO L87 Difference]: Start difference. First operand 1875 states and 2858 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:08,005 INFO L93 Difference]: Finished difference Result 4347 states and 6648 transitions. [2024-10-24 07:20:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 07:20:08,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-10-24 07:20:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:08,016 INFO L225 Difference]: With dead ends: 4347 [2024-10-24 07:20:08,016 INFO L226 Difference]: Without dead ends: 2473 [2024-10-24 07:20:08,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:20:08,021 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 287 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:08,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 961 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:20:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-10-24 07:20:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 1659. [2024-10-24 07:20:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1514 states have (on average 1.4715984147952443) internal successors, (2228), 1518 states have internal predecessors, (2228), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2500 transitions. [2024-10-24 07:20:08,196 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2500 transitions. Word has length 213 [2024-10-24 07:20:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:08,196 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2500 transitions. [2024-10-24 07:20:08,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2500 transitions. [2024-10-24 07:20:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:20:08,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:08,200 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:08,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 07:20:08,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1977519870, now seen corresponding path program 1 times [2024-10-24 07:20:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360662943] [2024-10-24 07:20:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:08,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:08,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360662943] [2024-10-24 07:20:08,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360662943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:08,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 07:20:08,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716225952] [2024-10-24 07:20:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:20:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:20:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:20:08,681 INFO L87 Difference]: Start difference. First operand 1659 states and 2500 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:09,264 INFO L93 Difference]: Finished difference Result 5001 states and 7590 transitions. [2024-10-24 07:20:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:20:09,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-10-24 07:20:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:09,277 INFO L225 Difference]: With dead ends: 5001 [2024-10-24 07:20:09,277 INFO L226 Difference]: Without dead ends: 3343 [2024-10-24 07:20:09,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:20:09,282 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 141 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:09,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1064 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:20:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2024-10-24 07:20:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 1655. [2024-10-24 07:20:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1510 states have (on average 1.4754966887417218) internal successors, (2228), 1514 states have internal predecessors, (2228), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2500 transitions. [2024-10-24 07:20:09,457 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2500 transitions. Word has length 213 [2024-10-24 07:20:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:09,458 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2500 transitions. [2024-10-24 07:20:09,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2500 transitions. [2024-10-24 07:20:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:20:09,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:09,461 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:09,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 07:20:09,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:09,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash 789758978, now seen corresponding path program 1 times [2024-10-24 07:20:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:09,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234957137] [2024-10-24 07:20:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:10,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:10,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234957137] [2024-10-24 07:20:10,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234957137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:10,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:10,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 07:20:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131462565] [2024-10-24 07:20:10,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:10,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:20:10,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:20:10,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:20:10,035 INFO L87 Difference]: Start difference. First operand 1655 states and 2500 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:10,371 INFO L93 Difference]: Finished difference Result 2927 states and 4406 transitions. [2024-10-24 07:20:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 07:20:10,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-10-24 07:20:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:10,381 INFO L225 Difference]: With dead ends: 2927 [2024-10-24 07:20:10,381 INFO L226 Difference]: Without dead ends: 2495 [2024-10-24 07:20:10,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:20:10,383 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 236 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:10,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 606 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:20:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-10-24 07:20:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1683. [2024-10-24 07:20:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1538 states have (on average 1.4759427828348504) internal successors, (2270), 1542 states have internal predecessors, (2270), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2542 transitions. [2024-10-24 07:20:10,562 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2542 transitions. Word has length 213 [2024-10-24 07:20:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:10,562 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2542 transitions. [2024-10-24 07:20:10,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2542 transitions. [2024-10-24 07:20:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:10,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:10,565 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 07:20:10,566 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2027963947, now seen corresponding path program 1 times [2024-10-24 07:20:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178784730] [2024-10-24 07:20:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178784730] [2024-10-24 07:20:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178784730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:10,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:10,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 07:20:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615687866] [2024-10-24 07:20:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:10,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:20:10,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:20:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:20:10,951 INFO L87 Difference]: Start difference. First operand 1683 states and 2542 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:12,062 INFO L93 Difference]: Finished difference Result 5182 states and 7830 transitions. [2024-10-24 07:20:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:20:12,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:12,082 INFO L225 Difference]: With dead ends: 5182 [2024-10-24 07:20:12,082 INFO L226 Difference]: Without dead ends: 3500 [2024-10-24 07:20:12,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:20:12,087 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 429 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:12,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1279 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 07:20:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2024-10-24 07:20:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 1967. [2024-10-24 07:20:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1822 states have (on average 1.4939626783754116) internal successors, (2722), 1826 states have internal predecessors, (2722), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2994 transitions. [2024-10-24 07:20:12,283 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2994 transitions. Word has length 214 [2024-10-24 07:20:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:12,284 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 2994 transitions. [2024-10-24 07:20:12,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2994 transitions. [2024-10-24 07:20:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:12,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:12,289 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:12,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 07:20:12,289 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:12,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1255886099, now seen corresponding path program 1 times [2024-10-24 07:20:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:12,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340334317] [2024-10-24 07:20:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340334317] [2024-10-24 07:20:12,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340334317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:12,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 07:20:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615432803] [2024-10-24 07:20:12,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:12,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:20:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:12,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:20:12,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:20:12,614 INFO L87 Difference]: Start difference. First operand 1967 states and 2994 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:13,221 INFO L93 Difference]: Finished difference Result 3273 states and 4971 transitions. [2024-10-24 07:20:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 07:20:13,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:13,237 INFO L225 Difference]: With dead ends: 3273 [2024-10-24 07:20:13,237 INFO L226 Difference]: Without dead ends: 2227 [2024-10-24 07:20:13,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:20:13,240 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 334 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:13,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 965 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 07:20:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2024-10-24 07:20:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1930. [2024-10-24 07:20:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1785 states have (on average 1.492436974789916) internal successors, (2664), 1789 states have internal predecessors, (2664), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2936 transitions. [2024-10-24 07:20:13,457 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2936 transitions. Word has length 214 [2024-10-24 07:20:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:13,458 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2936 transitions. [2024-10-24 07:20:13,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2936 transitions. [2024-10-24 07:20:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:13,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:13,463 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:13,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 07:20:13,464 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:13,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash 168907904, now seen corresponding path program 1 times [2024-10-24 07:20:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569048194] [2024-10-24 07:20:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:13,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:14,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569048194] [2024-10-24 07:20:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569048194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 07:20:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511170444] [2024-10-24 07:20:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:14,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 07:20:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 07:20:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:20:14,076 INFO L87 Difference]: Start difference. First operand 1930 states and 2936 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:15,035 INFO L93 Difference]: Finished difference Result 4109 states and 6251 transitions. [2024-10-24 07:20:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 07:20:15,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:15,045 INFO L225 Difference]: With dead ends: 4109 [2024-10-24 07:20:15,050 INFO L226 Difference]: Without dead ends: 3100 [2024-10-24 07:20:15,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-24 07:20:15,054 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 341 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:15,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1340 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 07:20:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2024-10-24 07:20:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 1939. [2024-10-24 07:20:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1794 states have (on average 1.4933110367892977) internal successors, (2679), 1798 states have internal predecessors, (2679), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2951 transitions. [2024-10-24 07:20:15,265 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2951 transitions. Word has length 214 [2024-10-24 07:20:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:15,265 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 2951 transitions. [2024-10-24 07:20:15,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2951 transitions. [2024-10-24 07:20:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:15,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:15,269 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:15,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 07:20:15,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:15,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1448771582, now seen corresponding path program 1 times [2024-10-24 07:20:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:15,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009605102] [2024-10-24 07:20:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:16,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009605102] [2024-10-24 07:20:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009605102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:16,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:16,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 07:20:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335080942] [2024-10-24 07:20:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 07:20:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:16,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 07:20:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:20:16,179 INFO L87 Difference]: Start difference. First operand 1939 states and 2951 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:16,995 INFO L93 Difference]: Finished difference Result 3531 states and 5356 transitions. [2024-10-24 07:20:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:20:16,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:17,008 INFO L225 Difference]: With dead ends: 3531 [2024-10-24 07:20:17,008 INFO L226 Difference]: Without dead ends: 2513 [2024-10-24 07:20:17,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-24 07:20:17,012 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 431 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:17,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 987 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 07:20:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-10-24 07:20:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1933. [2024-10-24 07:20:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1788 states have (on average 1.4927293064876956) internal successors, (2669), 1792 states have internal predecessors, (2669), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2941 transitions. [2024-10-24 07:20:17,176 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2941 transitions. Word has length 214 [2024-10-24 07:20:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:17,176 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2941 transitions. [2024-10-24 07:20:17,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2941 transitions. [2024-10-24 07:20:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:17,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:17,180 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:17,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 07:20:17,180 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:17,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash -206791821, now seen corresponding path program 1 times [2024-10-24 07:20:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:17,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173528440] [2024-10-24 07:20:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:17,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:17,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173528440] [2024-10-24 07:20:17,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173528440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:17,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:17,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:20:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061217109] [2024-10-24 07:20:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:17,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:20:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:17,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:20:17,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:20:17,388 INFO L87 Difference]: Start difference. First operand 1933 states and 2941 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:17,743 INFO L93 Difference]: Finished difference Result 3552 states and 5347 transitions. [2024-10-24 07:20:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:20:17,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:17,750 INFO L225 Difference]: With dead ends: 3552 [2024-10-24 07:20:17,750 INFO L226 Difference]: Without dead ends: 1620 [2024-10-24 07:20:17,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-10-24 07:20:17,756 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 298 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:17,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 471 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:20:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-10-24 07:20:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1375. [2024-10-24 07:20:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1230 states have (on average 1.4040650406504065) internal successors, (1727), 1234 states have internal predecessors, (1727), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1999 transitions. [2024-10-24 07:20:17,932 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1999 transitions. Word has length 214 [2024-10-24 07:20:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:17,932 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1999 transitions. [2024-10-24 07:20:17,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1999 transitions. [2024-10-24 07:20:17,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:17,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:17,935 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:17,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 07:20:17,936 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:17,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1202511224, now seen corresponding path program 1 times [2024-10-24 07:20:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312878617] [2024-10-24 07:20:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:18,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:18,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312878617] [2024-10-24 07:20:18,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312878617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:18,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:18,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 07:20:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308103673] [2024-10-24 07:20:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:18,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 07:20:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 07:20:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:20:18,465 INFO L87 Difference]: Start difference. First operand 1375 states and 1999 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:21,869 INFO L93 Difference]: Finished difference Result 5593 states and 8164 transitions. [2024-10-24 07:20:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 07:20:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:21,883 INFO L225 Difference]: With dead ends: 5593 [2024-10-24 07:20:21,883 INFO L226 Difference]: Without dead ends: 4219 [2024-10-24 07:20:21,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-10-24 07:20:21,887 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1274 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 1103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1103 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:21,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 810 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1103 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 07:20:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4219 states. [2024-10-24 07:20:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4219 to 1383. [2024-10-24 07:20:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1238 states have (on average 1.401453957996769) internal successors, (1735), 1242 states have internal predecessors, (1735), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2007 transitions. [2024-10-24 07:20:22,172 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2007 transitions. Word has length 214 [2024-10-24 07:20:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:22,173 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2007 transitions. [2024-10-24 07:20:22,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2007 transitions. [2024-10-24 07:20:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:22,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:22,180 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:22,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 07:20:22,180 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:22,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash -385836678, now seen corresponding path program 1 times [2024-10-24 07:20:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349923516] [2024-10-24 07:20:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349923516] [2024-10-24 07:20:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349923516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:20:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989812963] [2024-10-24 07:20:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:20:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:22,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:20:22,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:20:22,560 INFO L87 Difference]: Start difference. First operand 1383 states and 2007 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:23,956 INFO L93 Difference]: Finished difference Result 3758 states and 5451 transitions. [2024-10-24 07:20:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 07:20:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:23,964 INFO L225 Difference]: With dead ends: 3758 [2024-10-24 07:20:23,964 INFO L226 Difference]: Without dead ends: 2376 [2024-10-24 07:20:23,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:20:23,968 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 485 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:23,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 664 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 07:20:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2024-10-24 07:20:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1375. [2024-10-24 07:20:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1230 states have (on average 1.397560975609756) internal successors, (1719), 1234 states have internal predecessors, (1719), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 07:20:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1991 transitions. [2024-10-24 07:20:24,317 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1991 transitions. Word has length 214 [2024-10-24 07:20:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:24,318 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1991 transitions. [2024-10-24 07:20:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1991 transitions. [2024-10-24 07:20:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:24,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:24,322 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:24,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 07:20:24,323 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1816937363, now seen corresponding path program 1 times [2024-10-24 07:20:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779571660] [2024-10-24 07:20:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:25,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:25,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779571660] [2024-10-24 07:20:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779571660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:25,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 07:20:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811563487] [2024-10-24 07:20:25,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 07:20:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 07:20:25,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:20:25,282 INFO L87 Difference]: Start difference. First operand 1375 states and 1991 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:28,438 INFO L93 Difference]: Finished difference Result 3267 states and 4742 transitions. [2024-10-24 07:20:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 07:20:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:28,449 INFO L225 Difference]: With dead ends: 3267 [2024-10-24 07:20:28,449 INFO L226 Difference]: Without dead ends: 2855 [2024-10-24 07:20:28,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2024-10-24 07:20:28,452 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 669 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:28,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1442 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 07:20:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2024-10-24 07:20:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2538. [2024-10-24 07:20:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2167 states have (on average 1.3816335948315643) internal successors, (2994), 2175 states have internal predecessors, (2994), 352 states have call successors, (352), 18 states have call predecessors, (352), 18 states have return successors, (352), 344 states have call predecessors, (352), 352 states have call successors, (352) [2024-10-24 07:20:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3698 transitions. [2024-10-24 07:20:29,055 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3698 transitions. Word has length 214 [2024-10-24 07:20:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:29,056 INFO L471 AbstractCegarLoop]: Abstraction has 2538 states and 3698 transitions. [2024-10-24 07:20:29,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3698 transitions. [2024-10-24 07:20:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:20:29,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:29,059 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:29,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 07:20:29,059 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2009822846, now seen corresponding path program 1 times [2024-10-24 07:20:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:29,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912384820] [2024-10-24 07:20:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912384820] [2024-10-24 07:20:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912384820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 07:20:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801224222] [2024-10-24 07:20:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:29,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 07:20:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 07:20:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 07:20:29,518 INFO L87 Difference]: Start difference. First operand 2538 states and 3698 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:30,727 INFO L93 Difference]: Finished difference Result 4099 states and 5964 transitions. [2024-10-24 07:20:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 07:20:30,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-10-24 07:20:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:30,734 INFO L225 Difference]: With dead ends: 4099 [2024-10-24 07:20:30,734 INFO L226 Difference]: Without dead ends: 2450 [2024-10-24 07:20:30,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 07:20:30,739 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 220 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:30,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1307 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:20:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2024-10-24 07:20:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2382. [2024-10-24 07:20:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2045 states have (on average 1.3843520782396088) internal successors, (2831), 2052 states have internal predecessors, (2831), 320 states have call successors, (320), 16 states have call predecessors, (320), 16 states have return successors, (320), 313 states have call predecessors, (320), 320 states have call successors, (320) [2024-10-24 07:20:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3471 transitions. [2024-10-24 07:20:31,231 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3471 transitions. Word has length 214 [2024-10-24 07:20:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:31,231 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 3471 transitions. [2024-10-24 07:20:31,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3471 transitions. [2024-10-24 07:20:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 07:20:31,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:31,234 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:31,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 07:20:31,234 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:31,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1782608857, now seen corresponding path program 1 times [2024-10-24 07:20:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114517958] [2024-10-24 07:20:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:31,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114517958] [2024-10-24 07:20:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114517958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:31,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:31,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 07:20:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293817154] [2024-10-24 07:20:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:31,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 07:20:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 07:20:31,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:20:31,845 INFO L87 Difference]: Start difference. First operand 2382 states and 3471 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:33,000 INFO L93 Difference]: Finished difference Result 4206 states and 6097 transitions. [2024-10-24 07:20:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 07:20:33,001 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-10-24 07:20:33,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:33,011 INFO L225 Difference]: With dead ends: 4206 [2024-10-24 07:20:33,011 INFO L226 Difference]: Without dead ends: 3416 [2024-10-24 07:20:33,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-10-24 07:20:33,015 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 335 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:33,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1303 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 07:20:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2024-10-24 07:20:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 2443. [2024-10-24 07:20:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2098 states have (on average 1.3817921830314586) internal successors, (2899), 2106 states have internal predecessors, (2899), 320 states have call successors, (320), 24 states have call predecessors, (320), 24 states have return successors, (320), 312 states have call predecessors, (320), 320 states have call successors, (320) [2024-10-24 07:20:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3539 transitions. [2024-10-24 07:20:33,553 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3539 transitions. Word has length 215 [2024-10-24 07:20:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:33,554 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3539 transitions. [2024-10-24 07:20:33,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3539 transitions. [2024-10-24 07:20:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 07:20:33,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:33,557 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:33,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 07:20:33,558 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:33,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 771491607, now seen corresponding path program 1 times [2024-10-24 07:20:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:33,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45946315] [2024-10-24 07:20:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45946315] [2024-10-24 07:20:35,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45946315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:35,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:35,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 07:20:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091129595] [2024-10-24 07:20:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:35,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 07:20:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 07:20:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-24 07:20:35,080 INFO L87 Difference]: Start difference. First operand 2443 states and 3539 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:37,751 INFO L93 Difference]: Finished difference Result 3680 states and 5321 transitions. [2024-10-24 07:20:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 07:20:37,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-10-24 07:20:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:37,757 INFO L225 Difference]: With dead ends: 3680 [2024-10-24 07:20:37,757 INFO L226 Difference]: Without dead ends: 2854 [2024-10-24 07:20:37,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-10-24 07:20:37,760 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 549 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:37,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1676 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 07:20:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-10-24 07:20:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2473. [2024-10-24 07:20:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2111 states have (on average 1.379441023211748) internal successors, (2912), 2119 states have internal predecessors, (2912), 336 states have call successors, (336), 25 states have call predecessors, (336), 25 states have return successors, (336), 328 states have call predecessors, (336), 336 states have call successors, (336) [2024-10-24 07:20:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3584 transitions. [2024-10-24 07:20:38,282 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3584 transitions. Word has length 215 [2024-10-24 07:20:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:38,283 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3584 transitions. [2024-10-24 07:20:38,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3584 transitions. [2024-10-24 07:20:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 07:20:38,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:38,286 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:38,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 07:20:38,286 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:38,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1258343384, now seen corresponding path program 1 times [2024-10-24 07:20:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990879904] [2024-10-24 07:20:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:20:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:20:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:20:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:20:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:20:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:20:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:20:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:20:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:20:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 07:20:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 07:20:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 07:20:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 07:20:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 07:20:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 07:20:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:20:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 07:20:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:20:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 07:20:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:20:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 07:20:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 07:20:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 07:20:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:20:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:20:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 07:20:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 07:20:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 07:20:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 07:20:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 07:20:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 07:20:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 07:20:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:20:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-24 07:20:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:20:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990879904] [2024-10-24 07:20:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990879904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:20:38,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:20:38,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:20:38,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930676153] [2024-10-24 07:20:38,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:20:38,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:20:38,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:20:38,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:20:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:20:38,672 INFO L87 Difference]: Start difference. First operand 2473 states and 3584 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:20:39,443 INFO L93 Difference]: Finished difference Result 4340 states and 6269 transitions. [2024-10-24 07:20:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:20:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-10-24 07:20:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:20:39,452 INFO L225 Difference]: With dead ends: 4340 [2024-10-24 07:20:39,453 INFO L226 Difference]: Without dead ends: 2922 [2024-10-24 07:20:39,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:20:39,457 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 122 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:20:39,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 544 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:20:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2024-10-24 07:20:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2475. [2024-10-24 07:20:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2113 states have (on average 1.379081874112636) internal successors, (2914), 2120 states have internal predecessors, (2914), 336 states have call successors, (336), 25 states have call predecessors, (336), 25 states have return successors, (336), 329 states have call predecessors, (336), 336 states have call successors, (336) [2024-10-24 07:20:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3586 transitions. [2024-10-24 07:20:39,998 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3586 transitions. Word has length 215 [2024-10-24 07:20:39,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:20:39,998 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3586 transitions. [2024-10-24 07:20:39,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-24 07:20:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3586 transitions. [2024-10-24 07:20:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 07:20:40,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:40,001 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 07:20:40,001 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:40,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1632423833, now seen corresponding path program 1 times [2024-10-24 07:20:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:20:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852795813] [2024-10-24 07:20:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:20:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:20:40,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:20:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:20:40,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:20:40,231 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:20:40,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:20:40,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 07:20:40,237 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 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-10-24 07:20:40,392 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:20:40,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:20:40 BoogieIcfgContainer [2024-10-24 07:20:40,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:20:40,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:20:40,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:20:40,398 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:20:40,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:19:50" (3/4) ... [2024-10-24 07:20:40,401 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:20:40,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:20:40,402 INFO L158 Benchmark]: Toolchain (without parser) took 51405.93ms. Allocated memory was 184.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 127.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2024-10-24 07:20:40,403 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:20:40,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.62ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 109.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 07:20:40,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.49ms. Allocated memory is still 184.5MB. Free memory was 109.0MB in the beginning and 104.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:20:40,404 INFO L158 Benchmark]: Boogie Preprocessor took 84.17ms. Allocated memory is still 184.5MB. Free memory was 104.2MB in the beginning and 97.7MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 07:20:40,404 INFO L158 Benchmark]: RCFGBuilder took 776.49ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 97.7MB in the beginning and 213.3MB in the end (delta: -115.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-10-24 07:20:40,404 INFO L158 Benchmark]: TraceAbstraction took 50061.84ms. Allocated memory was 262.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 212.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2024-10-24 07:20:40,404 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:20:40,407 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.19ms. Allocated memory is still 184.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.62ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 109.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.49ms. Allocated memory is still 184.5MB. Free memory was 109.0MB in the beginning and 104.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.17ms. Allocated memory is still 184.5MB. Free memory was 104.2MB in the beginning and 97.7MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 776.49ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 97.7MB in the beginning and 213.3MB in the end (delta: -115.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50061.84ms. Allocated memory was 262.1MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 212.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. 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 206, overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of someUnaryDOUBLEoperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned char var_1_38 = 8; [L45] unsigned char var_1_39 = 10; [L46] double var_1_40 = 8.35; [L47] double var_1_41 = 63.75; [L48] double var_1_42 = -0.125; [L49] double var_1_43 = -0.8; [L50] double var_1_44 = -0.5; [L51] unsigned short int var_1_45 = 50; [L52] unsigned char var_1_46 = 0; [L53] unsigned char var_1_47 = 5; [L54] unsigned char var_1_48 = 1; [L55] signed char var_1_49 = -16; [L56] signed char var_1_50 = 2; [L57] signed char var_1_51 = 16; [L58] signed char var_1_52 = 0; [L59] signed long int var_1_53 = 256; [L60] double var_1_54 = 1.25; [L61] unsigned long int var_1_55 = 5; [L62] signed long int last_1_var_1_1 = 64; [L63] unsigned char last_1_var_1_13 = 64; [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L202] last_1_var_1_1 = var_1_1 [L203] last_1_var_1_13 = var_1_13 [L213] RET updateLastVariables() [L214] CALL updateVariables() [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_16 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] var_1_18 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] var_1_19 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_20 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_21 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_22 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_23 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] var_1_28 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] var_1_38 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] var_1_41 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] var_1_42 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_43 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] var_1_44 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] var_1_47 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] var_1_50 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] var_1_51 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] var_1_52 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET updateVariables() [L215] CALL step() [L67] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L68] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L71] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L72] COND FALSE !(\read(var_1_7)) [L75] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L77] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L80] var_1_32 = var_1_16 [L81] var_1_30 = var_1_32 [L82] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L84] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L86] COND TRUE var_1_11 >= var_1_30 [L87] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L90] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L98] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L99] COND TRUE ! var_1_7 [L100] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_1 ^ var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_13 | var_1_31 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] COND TRUE (var_1_1 ^ var_1_32) < (var_1_13 | var_1_31) [L109] var_1_33 = ((((var_1_38) > (var_1_39)) ? (var_1_38) : (var_1_39))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L113] COND TRUE (-32 & var_1_38) > var_1_31 [L114] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L118] COND FALSE !(var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L125] COND TRUE var_1_44 <= (var_1_29 + var_1_43) [L126] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L129] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L136] var_1_48 = var_1_39 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=-16, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L137] COND FALSE !(var_1_41 < var_1_29) [L140] var_1_49 = ((((((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) > (var_1_52)) ? (((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) : (var_1_52))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=5, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] var_1_53 = var_1_32 [L143] var_1_54 = var_1_44 [L144] var_1_55 = var_1_13 [L215] RET step() [L216] CALL, EXPR property() [L206] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=5, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=5, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=5, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=5, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206-L207] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=5, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=254, var_1_39=4, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=5, var_1_50=5, var_1_51=6, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.8s, OverallIterations: 30, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10023 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10023 mSDsluCounter, 24996 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18071 mSDsCounter, 2338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14902 IncrementalHoareTripleChecker+Invalid, 17240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2338 mSolverCounterUnsat, 6925 mSDtfsCounter, 14902 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2253 GetRequests, 1995 SyntacticMatches, 1 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2538occurred in iteration=25, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 16011 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 6392 NumberOfCodeBlocks, 6392 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 6148 ConstructedInterpolants, 0 QuantifiedInterpolants, 24392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 57536/57536 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-10-24 07:20:40,459 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:20:42,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:20:42,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:20:42,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:20:42,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:20:42,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:20:42,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:20:42,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:20:42,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:20:42,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:20:42,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:20:42,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:20:42,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:20:42,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:20:42,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:20:42,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:20:42,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:20:42,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:20:42,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:20:42,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:20:42,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:20:42,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:20:42,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:20:42,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:20:42,887 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:20:42,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:20:42,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:20:42,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:20:42,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:20:42,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:20:42,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:20:42,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:20:42,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:20:42,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:20:42,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:20:42,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:20:42,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:20:42,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:20:42,892 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:20:42,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:20:42,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:20:42,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:20:42,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:20:42,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:20:42,893 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:20:42,893 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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2024-10-24 07:20:43,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:20:43,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:20:43,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:20:43,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:20:43,209 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:20:43,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-10-24 07:20:44,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:20:45,034 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:20:45,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-10-24 07:20:45,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e7819fe/a958d9fe0c0f41bf828710d7d7d2b007/FLAG90c817252 [2024-10-24 07:20:45,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e7819fe/a958d9fe0c0f41bf828710d7d7d2b007 [2024-10-24 07:20:45,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:20:45,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:20:45,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:20:45,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:20:45,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:20:45,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d83b526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45, skipping insertion in model container [2024-10-24 07:20:45,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:20:45,282 WARN L248 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_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2024-10-24 07:20:45,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:20:45,394 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:20:45,407 WARN L248 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_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2024-10-24 07:20:45,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:20:45,481 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:20:45,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45 WrapperNode [2024-10-24 07:20:45,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:20:45,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:20:45,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:20:45,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:20:45,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,549 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-10-24 07:20:45,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:20:45,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:20:45,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:20:45,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:20:45,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,607 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-10-24 07:20:45,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:20:45,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:20:45,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:20:45,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:20:45,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (1/1) ... [2024-10-24 07:20:45,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:20:45,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:20:45,685 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-10-24 07:20:45,687 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-10-24 07:20:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:20:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:20:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:20:45,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:20:45,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:20:45,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:20:45,821 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:20:45,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:20:53,086 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 07:20:53,086 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:20:53,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:20:53,145 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:20:53,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:20:53 BoogieIcfgContainer [2024-10-24 07:20:53,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:20:53,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:20:53,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:20:53,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:20:53,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:20:45" (1/3) ... [2024-10-24 07:20:53,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f0e063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:20:53, skipping insertion in model container [2024-10-24 07:20:53,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:20:45" (2/3) ... [2024-10-24 07:20:53,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f0e063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:20:53, skipping insertion in model container [2024-10-24 07:20:53,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:20:53" (3/3) ... [2024-10-24 07:20:53,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-10-24 07:20:53,175 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:20:53,175 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:20:53,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:20:53,247 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;@78b35487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:20:53,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:20:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 07:20:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-24 07:20:53,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:20:53,267 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:20:53,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:20:53,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:20:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1531211019, now seen corresponding path program 1 times [2024-10-24 07:20:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:20:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828488087] [2024-10-24 07:20:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:20:53,286 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-10-24 07:20:53,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:20:53,289 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-10-24 07:20:53,311 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