./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-ps-ci_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-ps-ci_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:14:58,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:14:58,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:14:58,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:14:58,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:14:58,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:14:58,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:14:58,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:14:58,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:14:58,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:14:58,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:14:58,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:14:58,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:14:58,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:14:58,214 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:14:58,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:14:58,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:14:58,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:14:58,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:14:58,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:14:58,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:14:58,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:14:58,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:14:58,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:14:58,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:14:58,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:14:58,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:14:58,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:14:58,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:14:58,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:14:58,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:14:58,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:14:58,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:14:58,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:14:58,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:14:58,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:14:58,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:14:58,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:14:58,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:14:58,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:14:58,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:14:58,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:14:58,232 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 -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2024-10-14 10:14:58,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:14:58,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:14:58,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:14:58,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:14:58,498 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:14:58,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-10-14 10:15:00,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:15:00,244 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:15:00,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-10-14 10:15:00,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefab4d69/98bce6905a894181b44a4f58ac24680e/FLAG2a36d41f7 [2024-10-14 10:15:00,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefab4d69/98bce6905a894181b44a4f58ac24680e [2024-10-14 10:15:00,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:15:00,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:15:00,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:15:00,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:15:00,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:15:00,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:15:00" (1/1) ... [2024-10-14 10:15:00,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd05067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:00, skipping insertion in model container [2024-10-14 10:15:00,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:15:00" (1/1) ... [2024-10-14 10:15:00,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:15:00,839 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-ps-ci_file-84.i[919,932] [2024-10-14 10:15:00,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:15:00,957 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:15:00,970 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-ps-ci_file-84.i[919,932] [2024-10-14 10:15:01,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:15:01,056 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:15:01,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01 WrapperNode [2024-10-14 10:15:01,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:15:01,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:15:01,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:15:01,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:15:01,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,130 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-10-14 10:15:01,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:15:01,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:15:01,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:15:01,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:15:01,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,195 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-14 10:15:01,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:15:01,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:15:01,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:15:01,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:15:01,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (1/1) ... [2024-10-14 10:15:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:15:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:15:01,280 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-14 10:15:01,283 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-14 10:15:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:15:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:15:01,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:15:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:15:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:15:01,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:15:01,445 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:15:01,448 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:15:01,957 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-14 10:15:01,958 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:15:02,003 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:15:02,003 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:15:02,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:15:02 BoogieIcfgContainer [2024-10-14 10:15:02,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:15:02,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:15:02,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:15:02,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:15:02,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:15:00" (1/3) ... [2024-10-14 10:15:02,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2bfc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:15:02, skipping insertion in model container [2024-10-14 10:15:02,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:01" (2/3) ... [2024-10-14 10:15:02,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2bfc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:15:02, skipping insertion in model container [2024-10-14 10:15:02,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:15:02" (3/3) ... [2024-10-14 10:15:02,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-10-14 10:15:02,027 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:15:02,027 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:15:02,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:15:02,125 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;@344c7ed0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:15:02,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:15:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 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-14 10:15:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:15:02,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:02,155 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] [2024-10-14 10:15:02,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1797294768, now seen corresponding path program 1 times [2024-10-14 10:15:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708163387] [2024-10-14 10:15:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:02,796 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-14 10:15:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708163387] [2024-10-14 10:15:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708163387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:02,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:15:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007051270] [2024-10-14 10:15:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:15:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:15:02,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:15:02,834 INFO L87 Difference]: Start difference. First operand has 104 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 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) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-14 10:15:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:02,892 INFO L93 Difference]: Finished difference Result 205 states and 366 transitions. [2024-10-14 10:15:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:15:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 205 [2024-10-14 10:15:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:02,906 INFO L225 Difference]: With dead ends: 205 [2024-10-14 10:15:02,907 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 10:15:02,911 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-14 10:15:02,915 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:02,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:15:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 10:15:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-14 10:15:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 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-14 10:15:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 163 transitions. [2024-10-14 10:15:02,970 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 163 transitions. Word has length 205 [2024-10-14 10:15:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:02,971 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 163 transitions. [2024-10-14 10:15:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-14 10:15:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2024-10-14 10:15:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:15:02,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:02,976 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] [2024-10-14 10:15:02,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:15:02,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1196295180, now seen corresponding path program 1 times [2024-10-14 10:15:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247254733] [2024-10-14 10:15:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:03,337 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-14 10:15:03,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:03,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247254733] [2024-10-14 10:15:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247254733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:03,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:03,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:15:03,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190189477] [2024-10-14 10:15:03,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:03,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:15:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:15:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:15:03,347 INFO L87 Difference]: Start difference. First operand 102 states and 163 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-14 10:15:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:03,424 INFO L93 Difference]: Finished difference Result 200 states and 319 transitions. [2024-10-14 10:15:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:15:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 205 [2024-10-14 10:15:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:03,432 INFO L225 Difference]: With dead ends: 200 [2024-10-14 10:15:03,432 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 10:15:03,433 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-14 10:15:03,435 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:03,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 145 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:15:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 10:15:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 10:15:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 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-14 10:15:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-10-14 10:15:03,469 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 205 [2024-10-14 10:15:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:03,471 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-10-14 10:15:03,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-14 10:15:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-10-14 10:15:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-14 10:15:03,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:03,474 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] [2024-10-14 10:15:03,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:15:03,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2015638399, now seen corresponding path program 1 times [2024-10-14 10:15:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99432150] [2024-10-14 10:15:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:06,480 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-14 10:15:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:06,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99432150] [2024-10-14 10:15:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99432150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:06,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 10:15:06,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569072493] [2024-10-14 10:15:06,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:06,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:15:06,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:06,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:15:06,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:15:06,487 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-14 10:15:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:08,213 INFO L93 Difference]: Finished difference Result 267 states and 400 transitions. [2024-10-14 10:15:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 10:15:08,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 206 [2024-10-14 10:15:08,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:08,217 INFO L225 Difference]: With dead ends: 267 [2024-10-14 10:15:08,217 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 10:15:08,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:15:08,220 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 121 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:08,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 479 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 10:15:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 10:15:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2024-10-14 10:15:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 107 states have internal predecessors, (148), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2024-10-14 10:15:08,243 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 206 [2024-10-14 10:15:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:08,244 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2024-10-14 10:15:08,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-14 10:15:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2024-10-14 10:15:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 10:15:08,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:08,250 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] [2024-10-14 10:15:08,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:15:08,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:08,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2060793348, now seen corresponding path program 1 times [2024-10-14 10:15:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:08,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398839256] [2024-10-14 10:15:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:09,538 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-14 10:15:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398839256] [2024-10-14 10:15:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398839256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:15:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665479840] [2024-10-14 10:15:09,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:09,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:15:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:15:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:15:09,541 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 10:15:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:09,813 INFO L93 Difference]: Finished difference Result 348 states and 515 transitions. [2024-10-14 10:15:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:15:09,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 207 [2024-10-14 10:15:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:09,820 INFO L225 Difference]: With dead ends: 348 [2024-10-14 10:15:09,821 INFO L226 Difference]: Without dead ends: 206 [2024-10-14 10:15:09,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:15:09,825 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 64 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:09,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 591 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:15:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-14 10:15:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2024-10-14 10:15:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 107 states have internal predecessors, (148), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2024-10-14 10:15:09,858 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 207 [2024-10-14 10:15:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:09,859 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2024-10-14 10:15:09,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 10:15:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2024-10-14 10:15:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 10:15:09,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:09,862 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] [2024-10-14 10:15:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:15:09,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:09,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1473987334, now seen corresponding path program 1 times [2024-10-14 10:15:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700419133] [2024-10-14 10:15:09,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:10,618 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-14 10:15:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700419133] [2024-10-14 10:15:10,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700419133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:10,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:15:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380011579] [2024-10-14 10:15:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:10,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:15:10,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:15:10,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:15:10,624 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 10:15:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:10,861 INFO L93 Difference]: Finished difference Result 341 states and 505 transitions. [2024-10-14 10:15:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:15:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 207 [2024-10-14 10:15:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:10,864 INFO L225 Difference]: With dead ends: 341 [2024-10-14 10:15:10,865 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 10:15:10,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:15:10,866 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 64 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:10,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 574 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:15:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 10:15:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 135. [2024-10-14 10:15:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 99 states have internal predecessors, (136), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 204 transitions. [2024-10-14 10:15:10,884 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 204 transitions. Word has length 207 [2024-10-14 10:15:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 204 transitions. [2024-10-14 10:15:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 10:15:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 204 transitions. [2024-10-14 10:15:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 10:15:10,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:10,888 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] [2024-10-14 10:15:10,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:15:10,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash -342323784, now seen corresponding path program 1 times [2024-10-14 10:15:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:10,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773981411] [2024-10-14 10:15:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:15,965 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-14 10:15:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773981411] [2024-10-14 10:15:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773981411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:15:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504064939] [2024-10-14 10:15:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:15:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:15:15,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:15:15,968 INFO L87 Difference]: Start difference. First operand 135 states and 204 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-14 10:15:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:20,484 INFO L93 Difference]: Finished difference Result 518 states and 737 transitions. [2024-10-14 10:15:20,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 10:15:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 207 [2024-10-14 10:15:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:20,489 INFO L225 Difference]: With dead ends: 518 [2024-10-14 10:15:20,489 INFO L226 Difference]: Without dead ends: 384 [2024-10-14 10:15:20,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-14 10:15:20,491 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 276 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:20,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1001 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 10:15:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-14 10:15:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 152. [2024-10-14 10:15:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 116 states have internal predecessors, (163), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-10-14 10:15:20,518 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 207 [2024-10-14 10:15:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:20,519 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-10-14 10:15:20,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-14 10:15:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-10-14 10:15:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:15:20,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:20,522 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] [2024-10-14 10:15:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:15:20,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:20,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash -646913818, now seen corresponding path program 1 times [2024-10-14 10:15:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150626288] [2024-10-14 10:15:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:23,237 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-14 10:15:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150626288] [2024-10-14 10:15:23,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150626288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:23,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:23,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 10:15:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861544519] [2024-10-14 10:15:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:23,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 10:15:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:23,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 10:15:23,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:15:23,240 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 10:15:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:24,697 INFO L93 Difference]: Finished difference Result 375 states and 557 transitions. [2024-10-14 10:15:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 10:15:24,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2024-10-14 10:15:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:24,701 INFO L225 Difference]: With dead ends: 375 [2024-10-14 10:15:24,702 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 10:15:24,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:15:24,703 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 310 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:24,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 463 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 10:15:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 10:15:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 171. [2024-10-14 10:15:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 135 states have internal predecessors, (190), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2024-10-14 10:15:24,730 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 208 [2024-10-14 10:15:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:24,730 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2024-10-14 10:15:24,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 10:15:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2024-10-14 10:15:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:15:24,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:24,734 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] [2024-10-14 10:15:24,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:15:24,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:24,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1039940828, now seen corresponding path program 1 times [2024-10-14 10:15:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595698165] [2024-10-14 10:15:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:26,699 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-14 10:15:26,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595698165] [2024-10-14 10:15:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595698165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:26,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:26,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 10:15:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202116478] [2024-10-14 10:15:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:26,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 10:15:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 10:15:26,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:15:26,704 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-14 10:15:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:27,357 INFO L93 Difference]: Finished difference Result 382 states and 568 transitions. [2024-10-14 10:15:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 10:15:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 208 [2024-10-14 10:15:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:27,364 INFO L225 Difference]: With dead ends: 382 [2024-10-14 10:15:27,364 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 10:15:27,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:15:27,365 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 119 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:27,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 697 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:15:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 10:15:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 171. [2024-10-14 10:15:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 135 states have internal predecessors, (190), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2024-10-14 10:15:27,384 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 208 [2024-10-14 10:15:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:27,385 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2024-10-14 10:15:27,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-14 10:15:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2024-10-14 10:15:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:15:27,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:27,388 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] [2024-10-14 10:15:27,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:15:27,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -388748380, now seen corresponding path program 1 times [2024-10-14 10:15:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:27,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419905245] [2024-10-14 10:15:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:29,340 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-14 10:15:29,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419905245] [2024-10-14 10:15:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419905245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:15:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680081964] [2024-10-14 10:15:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:15:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:15:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:15:29,343 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-14 10:15:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:30,247 INFO L93 Difference]: Finished difference Result 397 states and 587 transitions. [2024-10-14 10:15:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:15:30,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 208 [2024-10-14 10:15:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:30,252 INFO L225 Difference]: With dead ends: 397 [2024-10-14 10:15:30,252 INFO L226 Difference]: Without dead ends: 227 [2024-10-14 10:15:30,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-14 10:15:30,255 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 94 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:30,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 795 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 10:15:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-14 10:15:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 173. [2024-10-14 10:15:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 137 states have internal predecessors, (193), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2024-10-14 10:15:30,281 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 261 transitions. Word has length 208 [2024-10-14 10:15:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:30,282 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 261 transitions. [2024-10-14 10:15:30,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-14 10:15:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2024-10-14 10:15:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:15:30,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:30,284 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] [2024-10-14 10:15:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 10:15:30,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash -781775390, now seen corresponding path program 1 times [2024-10-14 10:15:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425971524] [2024-10-14 10:15:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:32,637 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-14 10:15:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:32,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425971524] [2024-10-14 10:15:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425971524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 10:15:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407576754] [2024-10-14 10:15:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:32,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 10:15:32,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:32,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 10:15:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:15:32,641 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-14 10:15:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:33,807 INFO L93 Difference]: Finished difference Result 381 states and 567 transitions. [2024-10-14 10:15:33,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 10:15:33,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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 208 [2024-10-14 10:15:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:33,809 INFO L225 Difference]: With dead ends: 381 [2024-10-14 10:15:33,810 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 10:15:33,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-10-14 10:15:33,811 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 113 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:33,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 925 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 10:15:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 10:15:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 171. [2024-10-14 10:15:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 135 states have internal predecessors, (190), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2024-10-14 10:15:33,829 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 208 [2024-10-14 10:15:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:33,830 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2024-10-14 10:15:33,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-14 10:15:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2024-10-14 10:15:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:15:33,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:33,831 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] [2024-10-14 10:15:33,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 10:15:33,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:33,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1752373412, now seen corresponding path program 1 times [2024-10-14 10:15:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:33,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000696923] [2024-10-14 10:15:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:35,572 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-14 10:15:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000696923] [2024-10-14 10:15:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000696923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 10:15:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625898080] [2024-10-14 10:15:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:15:35,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:35,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:15:35,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:15:35,575 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-14 10:15:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:37,192 INFO L93 Difference]: Finished difference Result 700 states and 1007 transitions. [2024-10-14 10:15:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 10:15:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 208 [2024-10-14 10:15:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:37,197 INFO L225 Difference]: With dead ends: 700 [2024-10-14 10:15:37,197 INFO L226 Difference]: Without dead ends: 530 [2024-10-14 10:15:37,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:15:37,199 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 374 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:37,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 766 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:15:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-14 10:15:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 177. [2024-10-14 10:15:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 140 states have (on average 1.4285714285714286) internal successors, (200), 141 states have internal predecessors, (200), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 268 transitions. [2024-10-14 10:15:37,226 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 268 transitions. Word has length 208 [2024-10-14 10:15:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:37,227 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 268 transitions. [2024-10-14 10:15:37,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-14 10:15:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 268 transitions. [2024-10-14 10:15:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:15:37,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:37,229 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] [2024-10-14 10:15:37,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 10:15:37,229 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -117471153, now seen corresponding path program 1 times [2024-10-14 10:15:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239077500] [2024-10-14 10:15:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:37,776 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-14 10:15:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239077500] [2024-10-14 10:15:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239077500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:37,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:15:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637225453] [2024-10-14 10:15:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:37,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:15:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:37,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:15:37,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:15:37,779 INFO L87 Difference]: Start difference. First operand 177 states and 268 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-14 10:15:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:38,094 INFO L93 Difference]: Finished difference Result 406 states and 609 transitions. [2024-10-14 10:15:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:15:38,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 208 [2024-10-14 10:15:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:38,097 INFO L225 Difference]: With dead ends: 406 [2024-10-14 10:15:38,097 INFO L226 Difference]: Without dead ends: 230 [2024-10-14 10:15:38,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:15:38,098 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 41 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:38,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 658 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:15:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-14 10:15:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 175. [2024-10-14 10:15:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 139 states have internal predecessors, (196), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 264 transitions. [2024-10-14 10:15:38,117 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 264 transitions. Word has length 208 [2024-10-14 10:15:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:38,117 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 264 transitions. [2024-10-14 10:15:38,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-14 10:15:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 264 transitions. [2024-10-14 10:15:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 10:15:38,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:38,119 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] [2024-10-14 10:15:38,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 10:15:38,119 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1810408369, now seen corresponding path program 1 times [2024-10-14 10:15:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522492155] [2024-10-14 10:15:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:39,276 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-14 10:15:39,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:39,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522492155] [2024-10-14 10:15:39,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522492155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:39,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:39,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:15:39,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891439683] [2024-10-14 10:15:39,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:39,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:15:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:39,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:15:39,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:15:39,278 INFO L87 Difference]: Start difference. First operand 175 states and 264 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-14 10:15:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:40,571 INFO L93 Difference]: Finished difference Result 534 states and 775 transitions. [2024-10-14 10:15:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 10:15:40,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 208 [2024-10-14 10:15:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:40,574 INFO L225 Difference]: With dead ends: 534 [2024-10-14 10:15:40,574 INFO L226 Difference]: Without dead ends: 360 [2024-10-14 10:15:40,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:15:40,576 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 264 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:40,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 837 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:15:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-14 10:15:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 208. [2024-10-14 10:15:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 171 states have (on average 1.4385964912280702) internal successors, (246), 172 states have internal predecessors, (246), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 10:15:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 314 transitions. [2024-10-14 10:15:40,597 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 314 transitions. Word has length 208 [2024-10-14 10:15:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:40,597 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 314 transitions. [2024-10-14 10:15:40,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-14 10:15:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 314 transitions. [2024-10-14 10:15:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:15:40,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:40,599 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] [2024-10-14 10:15:40,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 10:15:40,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:40,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 100417995, now seen corresponding path program 1 times [2024-10-14 10:15:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:40,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289829511] [2024-10-14 10:15:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:40,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:40,868 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-14 10:15:40,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:40,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289829511] [2024-10-14 10:15:40,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289829511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:40,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:15:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137144843] [2024-10-14 10:15:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:40,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:15:40,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:40,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:15:40,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:15:40,870 INFO L87 Difference]: Start difference. First operand 208 states and 314 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-14 10:15:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:41,079 INFO L93 Difference]: Finished difference Result 621 states and 937 transitions. [2024-10-14 10:15:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:15:41,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 209 [2024-10-14 10:15:41,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:41,083 INFO L225 Difference]: With dead ends: 621 [2024-10-14 10:15:41,083 INFO L226 Difference]: Without dead ends: 414 [2024-10-14 10:15:41,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:15:41,084 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 114 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:41,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 512 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:15:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-14 10:15:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 280. [2024-10-14 10:15:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 209 states have (on average 1.4019138755980862) internal successors, (293), 210 states have internal predecessors, (293), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:15:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 425 transitions. [2024-10-14 10:15:41,124 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 425 transitions. Word has length 209 [2024-10-14 10:15:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:41,124 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 425 transitions. [2024-10-14 10:15:41,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-14 10:15:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 425 transitions. [2024-10-14 10:15:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:15:41,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:41,126 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] [2024-10-14 10:15:41,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 10:15:41,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:41,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash 334667365, now seen corresponding path program 1 times [2024-10-14 10:15:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482943322] [2024-10-14 10:15:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:41,244 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-14 10:15:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482943322] [2024-10-14 10:15:41,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482943322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:41,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:41,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:15:41,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497224010] [2024-10-14 10:15:41,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:41,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:15:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:41,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:15:41,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:15:41,246 INFO L87 Difference]: Start difference. First operand 280 states and 425 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-14 10:15:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:41,372 INFO L93 Difference]: Finished difference Result 524 states and 788 transitions. [2024-10-14 10:15:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:15:41,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 209 [2024-10-14 10:15:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:41,376 INFO L225 Difference]: With dead ends: 524 [2024-10-14 10:15:41,376 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 10:15:41,378 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-14 10:15:41,378 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 37 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:41,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 249 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:15:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 10:15:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2024-10-14 10:15:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 227 states have internal predecessors, (317), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:15:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 449 transitions. [2024-10-14 10:15:41,411 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 449 transitions. Word has length 209 [2024-10-14 10:15:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:41,412 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 449 transitions. [2024-10-14 10:15:41,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-14 10:15:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 449 transitions. [2024-10-14 10:15:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:15:41,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:41,413 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] [2024-10-14 10:15:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 10:15:41,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:41,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash 393632483, now seen corresponding path program 1 times [2024-10-14 10:15:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857836211] [2024-10-14 10:15:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:42,675 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-14 10:15:42,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857836211] [2024-10-14 10:15:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857836211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:42,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:15:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234592141] [2024-10-14 10:15:42,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:15:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:42,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:15:42,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:15:42,677 INFO L87 Difference]: Start difference. First operand 297 states and 449 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-14 10:15:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:43,309 INFO L93 Difference]: Finished difference Result 590 states and 870 transitions. [2024-10-14 10:15:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:15:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 209 [2024-10-14 10:15:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:43,315 INFO L225 Difference]: With dead ends: 590 [2024-10-14 10:15:43,316 INFO L226 Difference]: Without dead ends: 366 [2024-10-14 10:15:43,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:15:43,317 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 61 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:43,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 495 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:15:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-14 10:15:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 334. [2024-10-14 10:15:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 256 states have (on average 1.3515625) internal successors, (346), 258 states have internal predecessors, (346), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 10:15:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 486 transitions. [2024-10-14 10:15:43,367 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 486 transitions. Word has length 209 [2024-10-14 10:15:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:43,367 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 486 transitions. [2024-10-14 10:15:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-14 10:15:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 486 transitions. [2024-10-14 10:15:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:15:43,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:43,369 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] [2024-10-14 10:15:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 10:15:43,369 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1090662493, now seen corresponding path program 1 times [2024-10-14 10:15:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288161335] [2024-10-14 10:15:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:43,471 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-14 10:15:43,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:43,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288161335] [2024-10-14 10:15:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288161335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:43,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:43,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:15:43,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614206125] [2024-10-14 10:15:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:43,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:15:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:15:43,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:15:43,473 INFO L87 Difference]: Start difference. First operand 334 states and 486 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-14 10:15:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:43,615 INFO L93 Difference]: Finished difference Result 633 states and 907 transitions. [2024-10-14 10:15:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:15:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 209 [2024-10-14 10:15:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:43,618 INFO L225 Difference]: With dead ends: 633 [2024-10-14 10:15:43,618 INFO L226 Difference]: Without dead ends: 376 [2024-10-14 10:15:43,619 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-14 10:15:43,620 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 42 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:43,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 261 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:15:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-14 10:15:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 294. [2024-10-14 10:15:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 218 states have (on average 1.3073394495412844) internal successors, (285), 219 states have internal predecessors, (285), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 10:15:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2024-10-14 10:15:43,664 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 209 [2024-10-14 10:15:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:43,665 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2024-10-14 10:15:43,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-14 10:15:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2024-10-14 10:15:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:15:43,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:43,666 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] [2024-10-14 10:15:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 10:15:43,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 555802443, now seen corresponding path program 1 times [2024-10-14 10:15:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886506729] [2024-10-14 10:15:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:15:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:15:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:15:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:15:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:15:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:15:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:15:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:15:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:15:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:15:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:15:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 10:15:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:15:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 10:15:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:15:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:15:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 10:15:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 10:15:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 10:15:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 10:15:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 10:15:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 10:15:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 10:15:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 10:15:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 10:15:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 10:15:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 10:15:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 10:15:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 10:15:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 10:15:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 10:15:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 10:15:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 102 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2024-10-14 10:15:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886506729] [2024-10-14 10:15:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886506729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:15:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629018597] [2024-10-14 10:15:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:44,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:15:44,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:15:44,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:15:44,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:15:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:44,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 10:15:44,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:15:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1120 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-10-14 10:15:45,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:15:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-14 10:15:46,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629018597] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:15:46,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:15:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 22 [2024-10-14 10:15:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625837919] [2024-10-14 10:15:46,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:15:46,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 10:15:46,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:46,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 10:15:46,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-10-14 10:15:46,131 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 9 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 9 states have call predecessors, (84), 9 states have call successors, (84) [2024-10-14 10:15:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:47,475 INFO L93 Difference]: Finished difference Result 579 states and 815 transitions. [2024-10-14 10:15:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 10:15:47,475 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 9 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 9 states have call predecessors, (84), 9 states have call successors, (84) Word has length 210 [2024-10-14 10:15:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:47,478 INFO L225 Difference]: With dead ends: 579 [2024-10-14 10:15:47,478 INFO L226 Difference]: Without dead ends: 357 [2024-10-14 10:15:47,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=444, Invalid=1278, Unknown=0, NotChecked=0, Total=1722 [2024-10-14 10:15:47,480 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 416 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:47,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 755 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 10:15:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-14 10:15:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 318. [2024-10-14 10:15:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 238 states have (on average 1.2773109243697478) internal successors, (304), 239 states have internal predecessors, (304), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 10:15:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 440 transitions. [2024-10-14 10:15:47,534 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 440 transitions. Word has length 210 [2024-10-14 10:15:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:47,534 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 440 transitions. [2024-10-14 10:15:47,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 9 states have call successors, (83), 3 states have call predecessors, (83), 7 states have return successors, (84), 9 states have call predecessors, (84), 9 states have call successors, (84) [2024-10-14 10:15:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 440 transitions. [2024-10-14 10:15:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:15:47,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:47,536 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] [2024-10-14 10:15:47,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 10:15:47,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 10:15:47,737 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:47,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2110732679, now seen corresponding path program 1 times [2024-10-14 10:15:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374710884] [2024-10-14 10:15:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:15:47,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874614445] [2024-10-14 10:15:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:47,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:15:47,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:15:47,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:15:47,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 10:15:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:48,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 10:15:48,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:15:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-14 10:15:48,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:15:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 138 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2024-10-14 10:15:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:15:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374710884] [2024-10-14 10:15:49,135 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 10:15:49,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874614445] [2024-10-14 10:15:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874614445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:15:49,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:15:49,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-14 10:15:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139839354] [2024-10-14 10:15:49,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:15:49,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 10:15:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:15:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 10:15:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:15:49,138 INFO L87 Difference]: Start difference. First operand 318 states and 440 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 10:15:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:49,614 INFO L93 Difference]: Finished difference Result 598 states and 806 transitions. [2024-10-14 10:15:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 10:15:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 210 [2024-10-14 10:15:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:49,617 INFO L225 Difference]: With dead ends: 598 [2024-10-14 10:15:49,617 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 10:15:49,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2024-10-14 10:15:49,619 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 269 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:49,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 203 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:15:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 10:15:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 346. [2024-10-14 10:15:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 259 states have (on average 1.247104247104247) internal successors, (323), 260 states have internal predecessors, (323), 68 states have call successors, (68), 18 states have call predecessors, (68), 18 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 10:15:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 459 transitions. [2024-10-14 10:15:49,696 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 459 transitions. Word has length 210 [2024-10-14 10:15:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:49,697 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 459 transitions. [2024-10-14 10:15:49,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 4 states have call successors, (61), 3 states have call predecessors, (61), 7 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 10:15:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 459 transitions. [2024-10-14 10:15:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:15:49,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:49,699 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] [2024-10-14 10:15:49,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 10:15:49,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:15:49,900 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:49,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash -798031223, now seen corresponding path program 1 times [2024-10-14 10:15:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:15:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646735176] [2024-10-14 10:15:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:15:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:15:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316783897] [2024-10-14 10:15:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:50,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:15:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:15:50,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:15:50,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 10:15:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:15:50,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:15:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:15:50,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:15:50,423 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:15:50,424 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:15:50,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:15:50,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:15:50,633 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] [2024-10-14 10:15:50,787 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:15:50,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:15:50 BoogieIcfgContainer [2024-10-14 10:15:50,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:15:50,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:15:50,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:15:50,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:15:50,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:15:02" (3/4) ... [2024-10-14 10:15:50,795 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:15:50,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:15:50,797 INFO L158 Benchmark]: Toolchain (without parser) took 50175.39ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 119.8MB in the beginning and 449.2MB in the end (delta: -329.4MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2024-10-14 10:15:50,797 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:15:50,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.42ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 102.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 10:15:50,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.73ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 97.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:15:50,798 INFO L158 Benchmark]: Boogie Preprocessor took 111.31ms. Allocated memory is still 176.2MB. Free memory was 97.5MB in the beginning and 90.5MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:15:50,798 INFO L158 Benchmark]: RCFGBuilder took 760.22ms. Allocated memory is still 176.2MB. Free memory was 90.5MB in the beginning and 54.2MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-14 10:15:50,798 INFO L158 Benchmark]: TraceAbstraction took 48785.14ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 53.5MB in the beginning and 449.2MB in the end (delta: -395.7MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-10-14 10:15:50,801 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 616.6MB. Free memory is still 449.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:15:50,802 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.17ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.42ms. Allocated memory is still 176.2MB. Free memory was 119.2MB in the beginning and 102.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.73ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 97.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.31ms. Allocated memory is still 176.2MB. Free memory was 97.5MB in the beginning and 90.5MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 760.22ms. Allocated memory is still 176.2MB. Free memory was 90.5MB in the beginning and 54.2MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48785.14ms. Allocated memory was 176.2MB in the beginning and 616.6MB in the end (delta: 440.4MB). Free memory was 53.5MB in the beginning and 449.2MB in the end (delta: -395.7MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 616.6MB. Free memory is still 449.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someUnaryDOUBLEoperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] signed short int var_1_35 = 8; [L50] signed short int var_1_37 = -4; [L51] float var_1_38 = 15.875; [L52] double var_1_39 = 0.125; [L53] double var_1_40 = 3.8; [L54] signed char var_1_43 = -8; [L55] unsigned short int last_1_var_1_15 = 128; [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L186] last_1_var_1_15 = var_1_15 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L137] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] var_1_7 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L146] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L147] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L148] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L148] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-4, var_1_9=50] [L149] var_1_8 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L150] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L151] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L151] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L152] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L153] var_1_10 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L154] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L155] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L157] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L159] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L160] var_1_16 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L161] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L162] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L163] var_1_17 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L164] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L165] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L165] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L167] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L170] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L173] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L176] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L180] var_1_39 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L181] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L182] var_1_40 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L197] RET updateVariables() [L198] CALL step() [L59] var_1_22 = var_1_10 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L60] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L65] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L76] COND TRUE var_1_10 != ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L77] var_1_33 = (5 + var_1_11) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L79] COND FALSE !((~ var_1_4) > (var_1_4 / var_1_11)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L82] var_1_37 = ((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) < (var_1_4)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L83] COND FALSE !(var_1_7 == var_1_11) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L88] COND TRUE var_1_40 >= var_1_39 [L89] var_1_38 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L92] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L93] COND FALSE !(((var_1_11 + -128) % var_1_10) >= var_1_15) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L99] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=50] [L99] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L104] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L106] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L106] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L107] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L108] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L112] signed long int stepLocal_1 = -4; [L113] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L114] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L119] var_1_18 = var_1_17 [L120] var_1_19 = 0 [L121] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L125] COND TRUE var_1_3 <= var_1_1 [L126] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L130] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L131] COND TRUE (~ var_1_3) < stepLocal_2 [L132] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L189] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L189] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L189-L190] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=7, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=127, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.6s, OverallIterations: 20, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2941 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2923 mSDsluCounter, 10566 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7884 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6162 IncrementalHoareTripleChecker+Invalid, 6725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 2682 mSDtfsCounter, 6162 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2235 GetRequests, 2048 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=19, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 1446 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 4789 NumberOfCodeBlocks, 4789 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4557 ConstructedInterpolants, 0 QuantifiedInterpolants, 25887 SizeOfPredicates, 8 NumberOfNonLiveVariables, 958 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 43066/43648 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-14 10:15:50,948 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-ps-ci_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:15:53,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:15:53,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:15:53,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:15:53,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:15:53,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:15:53,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:15:53,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:15:53,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:15:53,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:15:53,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:15:53,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:15:53,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:15:53,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:15:53,131 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:15:53,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:15:53,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:15:53,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:15:53,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:15:53,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:15:53,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:15:53,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:15:53,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:15:53,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:15:53,140 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:15:53,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:15:53,140 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:15:53,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:15:53,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:15:53,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:15:53,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:15:53,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:15:53,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:15:53,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:15:53,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:15:53,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:15:53,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:15:53,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:15:53,144 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:15:53,144 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:15:53,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:15:53,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:15:53,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:15:53,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:15:53,146 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:15:53,146 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 -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2024-10-14 10:15:53,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:15:53,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:15:53,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:15:53,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:15:53,514 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:15:53,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-10-14 10:15:55,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:15:55,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:15:55,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-10-14 10:15:55,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2669f8e1/37ff04e673334831a69d1c47745a90e1/FLAGae1eb409a [2024-10-14 10:15:55,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2669f8e1/37ff04e673334831a69d1c47745a90e1 [2024-10-14 10:15:55,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:15:55,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:15:55,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:15:55,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:15:55,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:15:55,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8d60ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55, skipping insertion in model container [2024-10-14 10:15:55,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:15:55,582 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-ps-ci_file-84.i[919,932] [2024-10-14 10:15:55,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:15:55,695 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:15:55,707 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-ps-ci_file-84.i[919,932] [2024-10-14 10:15:55,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:15:55,786 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:15:55,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55 WrapperNode [2024-10-14 10:15:55,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:15:55,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:15:55,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:15:55,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:15:55,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,846 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-14 10:15:55,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:15:55,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:15:55,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:15:55,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:15:55,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,890 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-14 10:15:55,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:15:55,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:15:55,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:15:55,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:15:55,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (1/1) ... [2024-10-14 10:15:55,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:15:55,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:15:55,961 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-14 10:15:55,967 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-14 10:15:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:15:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:15:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:15:56,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:15:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:15:56,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:15:56,115 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:15:56,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:15:57,723 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 10:15:57,723 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:15:57,791 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:15:57,791 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:15:57,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:15:57 BoogieIcfgContainer [2024-10-14 10:15:57,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:15:57,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:15:57,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:15:57,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:15:57,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:15:55" (1/3) ... [2024-10-14 10:15:57,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad8dbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:15:57, skipping insertion in model container [2024-10-14 10:15:57,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:15:55" (2/3) ... [2024-10-14 10:15:57,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad8dbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:15:57, skipping insertion in model container [2024-10-14 10:15:57,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:15:57" (3/3) ... [2024-10-14 10:15:57,802 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2024-10-14 10:15:57,819 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:15:57,819 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:15:57,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:15:57,904 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;@4514334d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:15:57,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:15:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 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-14 10:15:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 10:15:57,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:57,931 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] [2024-10-14 10:15:57,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash 742464302, now seen corresponding path program 1 times [2024-10-14 10:15:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:15:57,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509857404] [2024-10-14 10:15:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:57,953 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-14 10:15:57,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:15:57,957 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-14 10:15:57,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 10:15:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:58,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:15:58,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:15:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 1586 trivial. 0 not checked. [2024-10-14 10:15:58,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:15:58,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:15:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509857404] [2024-10-14 10:15:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509857404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:15:58,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:15:58,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:15:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566426648] [2024-10-14 10:15:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:15:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:15:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:15:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:15:58,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:15:58,418 INFO L87 Difference]: Start difference. First operand has 86 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 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) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 10:15:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:15:58,501 INFO L93 Difference]: Finished difference Result 169 states and 310 transitions. [2024-10-14 10:15:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:15:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-14 10:15:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:15:58,521 INFO L225 Difference]: With dead ends: 169 [2024-10-14 10:15:58,521 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 10:15:58,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-14 10:15:58,532 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:15:58,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:15:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 10:15:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 10:15:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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-14 10:15:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 135 transitions. [2024-10-14 10:15:58,582 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 135 transitions. Word has length 199 [2024-10-14 10:15:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:15:58,582 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 135 transitions. [2024-10-14 10:15:58,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 10:15:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 135 transitions. [2024-10-14 10:15:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 10:15:58,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:15:58,589 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] [2024-10-14 10:15:58,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 10:15:58,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:15:58,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:15:58,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:15:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1694380174, now seen corresponding path program 1 times [2024-10-14 10:15:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:15:58,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637287240] [2024-10-14 10:15:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:15:58,792 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-14 10:15:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:15:58,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:15:58,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 10:15:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:15:59,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:15:59,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:16:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-14 10:16:00,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:16:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 10:16:01,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:16:01,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637287240] [2024-10-14 10:16:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637287240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:16:01,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:16:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-10-14 10:16:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762895617] [2024-10-14 10:16:01,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:16:01,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 10:16:01,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:16:01,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 10:16:01,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:16:01,319 INFO L87 Difference]: Start difference. First operand 84 states and 135 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 10:16:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:16:02,268 INFO L93 Difference]: Finished difference Result 179 states and 279 transitions. [2024-10-14 10:16:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 10:16:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 199 [2024-10-14 10:16:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:16:02,282 INFO L225 Difference]: With dead ends: 179 [2024-10-14 10:16:02,282 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 10:16:02,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:16:02,284 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 144 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 10:16:02,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 212 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 10:16:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 10:16:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-14 10:16:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 10:16:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 140 transitions. [2024-10-14 10:16:02,303 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 140 transitions. Word has length 199 [2024-10-14 10:16:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:16:02,304 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 140 transitions. [2024-10-14 10:16:02,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-14 10:16:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2024-10-14 10:16:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 10:16:02,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:16:02,312 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] [2024-10-14 10:16:02,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 10:16:02,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:16:02,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:16:02,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:16:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 606442416, now seen corresponding path program 1 times [2024-10-14 10:16:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:16:02,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15881281] [2024-10-14 10:16:02,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:16:02,515 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-14 10:16:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:16:02,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:16:02,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:16:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:16:02,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:16:02,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:16:02,810 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-14 10:16:02,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:16:02,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:16:02,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15881281] [2024-10-14 10:16:02,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15881281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:16:02,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:16:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:16:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777152318] [2024-10-14 10:16:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:16:02,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:16:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:16:02,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:16:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:16:02,815 INFO L87 Difference]: Start difference. First operand 92 states and 140 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-14 10:16:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:16:02,911 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2024-10-14 10:16:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:16:02,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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 199 [2024-10-14 10:16:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:16:02,923 INFO L225 Difference]: With dead ends: 180 [2024-10-14 10:16:02,923 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 10:16:02,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 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-14 10:16:02,925 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:16:02,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 117 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:16:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 10:16:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-14 10:16:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 10:16:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2024-10-14 10:16:02,942 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 199 [2024-10-14 10:16:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:16:02,943 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2024-10-14 10:16:02,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-14 10:16:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2024-10-14 10:16:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 10:16:02,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:16:02,947 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] [2024-10-14 10:16:02,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 10:16:03,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:16:03,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:16:03,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:16:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1875800729, now seen corresponding path program 1 times [2024-10-14 10:16:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:16:03,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924694982] [2024-10-14 10:16:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:16:03,150 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-14 10:16:03,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:16:03,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:16:03,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 10:16:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:16:03,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 10:16:03,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:16:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1080 proven. 147 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-10-14 10:16:05,155 INFO L311 TraceCheckSpWp]: Computing backward predicates...