/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 16:02:29,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 16:02:29,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 16:02:29,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 16:02:29,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 16:02:29,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 16:02:29,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 16:02:29,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 16:02:29,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 16:02:29,409 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 16:02:29,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 16:02:29,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 16:02:29,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 16:02:29,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 16:02:29,412 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 16:02:29,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 16:02:29,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 16:02:29,412 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 16:02:29,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 16:02:29,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 16:02:29,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 16:02:29,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 16:02:29,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 16:02:29,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 16:02:29,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 16:02:29,414 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 16:02:29,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 16:02:29,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 16:02:29,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 16:02:29,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 16:02:29,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 16:02:29,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 16:02:29,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:02:29,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 16:02:29,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 16:02:29,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 16:02:29,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 16:02:29,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 16:02:29,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 16:02:29,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 16:02:29,418 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 16:02:29,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 16:02:29,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 16:02:29,418 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: Use bitabs translation -> true [2023-12-19 16:02:29,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 16:02:29,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 16:02:29,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 16:02:29,676 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 16:02:29,676 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 16:02:29,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2023-12-19 16:02:30,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 16:02:31,046 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 16:02:31,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2023-12-19 16:02:31,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396d89340/4114a66dec954ceda2b176f01c2a7a88/FLAG9cb8f594d [2023-12-19 16:02:31,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396d89340/4114a66dec954ceda2b176f01c2a7a88 [2023-12-19 16:02:31,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 16:02:31,080 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 16:02:31,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 16:02:31,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 16:02:31,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 16:02:31,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6225b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31, skipping insertion in model container [2023-12-19 16:02:31,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,123 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 16:02:31,254 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2023-12-19 16:02:31,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:02:31,309 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 16:02:31,320 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2023-12-19 16:02:31,349 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:02:31,368 INFO L206 MainTranslator]: Completed translation [2023-12-19 16:02:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31 WrapperNode [2023-12-19 16:02:31,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 16:02:31,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 16:02:31,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 16:02:31,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 16:02:31,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,421 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2023-12-19 16:02:31,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 16:02:31,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 16:02:31,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 16:02:31,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 16:02:31,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,457 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2023-12-19 16:02:31,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 16:02:31,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 16:02:31,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 16:02:31,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 16:02:31,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (1/1) ... [2023-12-19 16:02:31,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:02:31,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:02:31,519 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) [2023-12-19 16:02:31,539 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 [2023-12-19 16:02:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 16:02:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 16:02:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 16:02:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 16:02:31,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 16:02:31,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 16:02:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 16:02:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 16:02:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 16:02:31,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 16:02:31,642 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 16:02:31,644 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 16:02:32,162 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 16:02:32,195 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 16:02:32,196 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 16:02:32,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:02:32 BoogieIcfgContainer [2023-12-19 16:02:32,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 16:02:32,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 16:02:32,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 16:02:32,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 16:02:32,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:02:31" (1/3) ... [2023-12-19 16:02:32,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe137be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:02:32, skipping insertion in model container [2023-12-19 16:02:32,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:02:31" (2/3) ... [2023-12-19 16:02:32,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe137be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:02:32, skipping insertion in model container [2023-12-19 16:02:32,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:02:32" (3/3) ... [2023-12-19 16:02:32,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2023-12-19 16:02:32,219 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 16:02:32,220 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 16:02:32,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 16:02:32,275 INFO L357 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, mHoare=true, 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;@24e3a639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 16:02:32,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 16:02:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 82 states have (on average 1.548780487804878) internal successors, (127), 83 states have internal predecessors, (127), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 16:02:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 16:02:32,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:32,292 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:32,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:32,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1261899332, now seen corresponding path program 1 times [2023-12-19 16:02:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075274719] [2023-12-19 16:02:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:32,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:32,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:32,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075274719] [2023-12-19 16:02:32,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075274719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:32,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:32,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 16:02:32,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372787323] [2023-12-19 16:02:32,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:32,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 16:02:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:32,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 16:02:32,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:02:32,649 INFO L87 Difference]: Start difference. First operand has 94 states, 82 states have (on average 1.548780487804878) internal successors, (127), 83 states have internal predecessors, (127), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:32,692 INFO L93 Difference]: Finished difference Result 185 states and 297 transitions. [2023-12-19 16:02:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 16:02:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2023-12-19 16:02:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:32,705 INFO L225 Difference]: With dead ends: 185 [2023-12-19 16:02:32,705 INFO L226 Difference]: Without dead ends: 92 [2023-12-19 16:02:32,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:02:32,711 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:32,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-19 16:02:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-19 16:02:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 81 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 16:02:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 140 transitions. [2023-12-19 16:02:32,746 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 140 transitions. Word has length 93 [2023-12-19 16:02:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:32,747 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 140 transitions. [2023-12-19 16:02:32,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2023-12-19 16:02:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 16:02:32,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:32,751 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:32,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 16:02:32,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:32,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -805077690, now seen corresponding path program 1 times [2023-12-19 16:02:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665058119] [2023-12-19 16:02:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665058119] [2023-12-19 16:02:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665058119] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:02:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316735705] [2023-12-19 16:02:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:33,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:02:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:02:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:02:33,109 INFO L87 Difference]: Start difference. First operand 92 states and 140 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:33,200 INFO L93 Difference]: Finished difference Result 189 states and 288 transitions. [2023-12-19 16:02:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:02:33,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2023-12-19 16:02:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:33,209 INFO L225 Difference]: With dead ends: 189 [2023-12-19 16:02:33,209 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 16:02:33,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:33,211 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 10 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:33,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 397 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 16:02:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-19 16:02:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 83 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 16:02:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2023-12-19 16:02:33,222 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 93 [2023-12-19 16:02:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:33,222 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2023-12-19 16:02:33,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2023-12-19 16:02:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 16:02:33,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:33,228 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:33,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 16:02:33,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:33,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash -789558972, now seen corresponding path program 1 times [2023-12-19 16:02:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697640753] [2023-12-19 16:02:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:33,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697640753] [2023-12-19 16:02:33,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697640753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:33,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:33,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 16:02:33,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024020253] [2023-12-19 16:02:33,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:33,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 16:02:33,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:33,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 16:02:33,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 16:02:33,458 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:33,496 INFO L93 Difference]: Finished difference Result 191 states and 288 transitions. [2023-12-19 16:02:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:02:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2023-12-19 16:02:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:33,499 INFO L225 Difference]: With dead ends: 191 [2023-12-19 16:02:33,499 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 16:02:33,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:33,500 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 3 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:33,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 397 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 16:02:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-12-19 16:02:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 85 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 16:02:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2023-12-19 16:02:33,510 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 93 [2023-12-19 16:02:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:33,510 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2023-12-19 16:02:33,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2023-12-19 16:02:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 16:02:33,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:33,513 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:33,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 16:02:33,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:33,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash -789499390, now seen corresponding path program 1 times [2023-12-19 16:02:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775854071] [2023-12-19 16:02:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:33,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:34,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775854071] [2023-12-19 16:02:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775854071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:34,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:34,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:02:34,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305717085] [2023-12-19 16:02:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:34,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:02:34,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:34,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:02:34,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:34,623 INFO L87 Difference]: Start difference. First operand 96 states and 144 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:35,052 INFO L93 Difference]: Finished difference Result 258 states and 387 transitions. [2023-12-19 16:02:35,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:35,053 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2023-12-19 16:02:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:35,057 INFO L225 Difference]: With dead ends: 258 [2023-12-19 16:02:35,058 INFO L226 Difference]: Without dead ends: 163 [2023-12-19 16:02:35,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:02:35,067 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 708 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:35,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 426 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-19 16:02:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 102. [2023-12-19 16:02:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 91 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-19 16:02:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2023-12-19 16:02:35,089 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 93 [2023-12-19 16:02:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:35,090 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2023-12-19 16:02:35,090 INFO L496 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2023-12-19 16:02:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 16:02:35,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:35,092 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:35,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 16:02:35,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:35,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1800616640, now seen corresponding path program 1 times [2023-12-19 16:02:35,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:35,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638682462] [2023-12-19 16:02:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:35,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-19 16:02:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638682462] [2023-12-19 16:02:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638682462] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:02:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632208789] [2023-12-19 16:02:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:36,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:02:36,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:02:36,174 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) [2023-12-19 16:02:36,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 16:02:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:36,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-19 16:02:36,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:02:36,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-12-19 16:02:36,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-12-19 16:02:36,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-12-19 16:02:37,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-12-19 16:02:37,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-12-19 16:02:37,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:02:37,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2023-12-19 16:02:37,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:02:37,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-19 16:02:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-19 16:02:37,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:02:37,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632208789] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:02:37,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 16:02:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-19 16:02:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069863747] [2023-12-19 16:02:37,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 16:02:37,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 16:02:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:37,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 16:02:37,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-12-19 16:02:37,659 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 16 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-19 16:02:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:38,213 INFO L93 Difference]: Finished difference Result 255 states and 376 transitions. [2023-12-19 16:02:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 16:02:38,214 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 93 [2023-12-19 16:02:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:38,218 INFO L225 Difference]: With dead ends: 255 [2023-12-19 16:02:38,218 INFO L226 Difference]: Without dead ends: 154 [2023-12-19 16:02:38,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2023-12-19 16:02:38,220 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 65 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:38,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 968 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:02:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-19 16:02:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2023-12-19 16:02:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.424) internal successors, (178), 125 states have internal predecessors, (178), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-19 16:02:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2023-12-19 16:02:38,261 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 93 [2023-12-19 16:02:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:38,262 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2023-12-19 16:02:38,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.928571428571429) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-19 16:02:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2023-12-19 16:02:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 16:02:38,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:38,267 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:38,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 16:02:38,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:02:38,475 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:38,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1984877566, now seen corresponding path program 1 times [2023-12-19 16:02:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061653532] [2023-12-19 16:02:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:40,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:40,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061653532] [2023-12-19 16:02:40,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061653532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:40,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:02:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541194960] [2023-12-19 16:02:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:40,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:02:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:02:40,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:02:40,368 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:41,039 INFO L93 Difference]: Finished difference Result 420 states and 624 transitions. [2023-12-19 16:02:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 16:02:41,040 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2023-12-19 16:02:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:41,041 INFO L225 Difference]: With dead ends: 420 [2023-12-19 16:02:41,042 INFO L226 Difference]: Without dead ends: 319 [2023-12-19 16:02:41,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-12-19 16:02:41,044 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 490 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:41,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 846 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:02:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-19 16:02:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 256. [2023-12-19 16:02:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 224 states have (on average 1.4508928571428572) internal successors, (325), 224 states have internal predecessors, (325), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2023-12-19 16:02:41,077 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 93 [2023-12-19 16:02:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:41,078 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2023-12-19 16:02:41,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2023-12-19 16:02:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 16:02:41,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:41,079 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:41,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 16:02:41,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:41,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:41,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1766022848, now seen corresponding path program 1 times [2023-12-19 16:02:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:41,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530193730] [2023-12-19 16:02:41,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:41,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530193730] [2023-12-19 16:02:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530193730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:41,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:41,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039787237] [2023-12-19 16:02:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:41,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:41,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:41,544 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:41,817 INFO L93 Difference]: Finished difference Result 565 states and 847 transitions. [2023-12-19 16:02:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:41,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2023-12-19 16:02:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:41,819 INFO L225 Difference]: With dead ends: 565 [2023-12-19 16:02:41,819 INFO L226 Difference]: Without dead ends: 355 [2023-12-19 16:02:41,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:41,820 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 215 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:41,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 622 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-19 16:02:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 260. [2023-12-19 16:02:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.4429824561403508) internal successors, (329), 228 states have internal predecessors, (329), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2023-12-19 16:02:41,844 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 93 [2023-12-19 16:02:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:41,844 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2023-12-19 16:02:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2023-12-19 16:02:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-19 16:02:41,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:41,845 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:41,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 16:02:41,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:41,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash -500482880, now seen corresponding path program 1 times [2023-12-19 16:02:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:41,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720590471] [2023-12-19 16:02:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720590471] [2023-12-19 16:02:42,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720590471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:42,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:42,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:42,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872046211] [2023-12-19 16:02:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:42,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:42,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:42,071 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:42,299 INFO L93 Difference]: Finished difference Result 626 states and 926 transitions. [2023-12-19 16:02:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:02:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2023-12-19 16:02:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:42,302 INFO L225 Difference]: With dead ends: 626 [2023-12-19 16:02:42,302 INFO L226 Difference]: Without dead ends: 412 [2023-12-19 16:02:42,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:42,303 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 291 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:42,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 458 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-12-19 16:02:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 280. [2023-12-19 16:02:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 248 states have (on average 1.4475806451612903) internal successors, (359), 248 states have internal predecessors, (359), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 413 transitions. [2023-12-19 16:02:42,335 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 413 transitions. Word has length 94 [2023-12-19 16:02:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:42,336 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 413 transitions. [2023-12-19 16:02:42,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 413 transitions. [2023-12-19 16:02:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 16:02:42,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:42,337 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:42,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 16:02:42,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:42,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -791840733, now seen corresponding path program 1 times [2023-12-19 16:02:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499485011] [2023-12-19 16:02:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499485011] [2023-12-19 16:02:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499485011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:43,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:02:43,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832494604] [2023-12-19 16:02:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:43,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:02:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:43,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:02:43,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:02:43,150 INFO L87 Difference]: Start difference. First operand 280 states and 413 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:43,518 INFO L93 Difference]: Finished difference Result 653 states and 974 transitions. [2023-12-19 16:02:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 16:02:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2023-12-19 16:02:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:43,521 INFO L225 Difference]: With dead ends: 653 [2023-12-19 16:02:43,521 INFO L226 Difference]: Without dead ends: 419 [2023-12-19 16:02:43,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:02:43,522 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 455 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:43,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 401 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-19 16:02:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 318. [2023-12-19 16:02:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 286 states have (on average 1.4580419580419581) internal successors, (417), 286 states have internal predecessors, (417), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 471 transitions. [2023-12-19 16:02:43,574 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 471 transitions. Word has length 95 [2023-12-19 16:02:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:43,574 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 471 transitions. [2023-12-19 16:02:43,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 471 transitions. [2023-12-19 16:02:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 16:02:43,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:43,576 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:43,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 16:02:43,576 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:43,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1378646747, now seen corresponding path program 1 times [2023-12-19 16:02:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:43,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039254999] [2023-12-19 16:02:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039254999] [2023-12-19 16:02:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039254999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:02:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272817422] [2023-12-19 16:02:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:43,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:02:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:02:43,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:02:43,706 INFO L87 Difference]: Start difference. First operand 318 states and 471 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:43,773 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2023-12-19 16:02:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:02:43,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-19 16:02:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:43,776 INFO L225 Difference]: With dead ends: 637 [2023-12-19 16:02:43,776 INFO L226 Difference]: Without dead ends: 365 [2023-12-19 16:02:43,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:43,778 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 92 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:43,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 538 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-19 16:02:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 323. [2023-12-19 16:02:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 291 states have (on average 1.4501718213058419) internal successors, (422), 291 states have internal predecessors, (422), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2023-12-19 16:02:43,812 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 95 [2023-12-19 16:02:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:43,813 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2023-12-19 16:02:43,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2023-12-19 16:02:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 16:02:43,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:43,814 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:43,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 16:02:43,814 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:43,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash 927397991, now seen corresponding path program 1 times [2023-12-19 16:02:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889188655] [2023-12-19 16:02:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:43,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889188655] [2023-12-19 16:02:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889188655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:43,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:43,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:02:43,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832434346] [2023-12-19 16:02:43,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:43,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:02:43,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:43,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:02:43,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:43,904 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:43,940 INFO L93 Difference]: Finished difference Result 484 states and 721 transitions. [2023-12-19 16:02:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:02:43,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-19 16:02:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:43,943 INFO L225 Difference]: With dead ends: 484 [2023-12-19 16:02:43,943 INFO L226 Difference]: Without dead ends: 330 [2023-12-19 16:02:43,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:02:43,944 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:43,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:02:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-12-19 16:02:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2023-12-19 16:02:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 298 states have (on average 1.4395973154362416) internal successors, (429), 298 states have internal predecessors, (429), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 483 transitions. [2023-12-19 16:02:43,974 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 483 transitions. Word has length 95 [2023-12-19 16:02:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:43,974 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 483 transitions. [2023-12-19 16:02:43,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 483 transitions. [2023-12-19 16:02:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 16:02:43,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:43,975 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:43,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 16:02:43,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:43,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash -561204583, now seen corresponding path program 1 times [2023-12-19 16:02:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368426536] [2023-12-19 16:02:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368426536] [2023-12-19 16:02:44,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368426536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:44,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:44,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 16:02:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002979023] [2023-12-19 16:02:44,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:44,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 16:02:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 16:02:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:02:44,238 INFO L87 Difference]: Start difference. First operand 330 states and 483 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:44,619 INFO L93 Difference]: Finished difference Result 892 states and 1300 transitions. [2023-12-19 16:02:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:02:44,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2023-12-19 16:02:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:44,622 INFO L225 Difference]: With dead ends: 892 [2023-12-19 16:02:44,623 INFO L226 Difference]: Without dead ends: 608 [2023-12-19 16:02:44,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:02:44,624 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 367 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:44,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 782 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2023-12-19 16:02:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 348. [2023-12-19 16:02:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 316 states have (on average 1.4430379746835442) internal successors, (456), 316 states have internal predecessors, (456), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 510 transitions. [2023-12-19 16:02:44,659 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 510 transitions. Word has length 95 [2023-12-19 16:02:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:44,660 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 510 transitions. [2023-12-19 16:02:44,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 510 transitions. [2023-12-19 16:02:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 16:02:44,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:44,661 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:44,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 16:02:44,661 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:44,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:44,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2039216392, now seen corresponding path program 1 times [2023-12-19 16:02:44,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:44,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791418133] [2023-12-19 16:02:44,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:44,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791418133] [2023-12-19 16:02:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791418133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:02:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680616594] [2023-12-19 16:02:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:44,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:02:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:02:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:02:44,903 INFO L87 Difference]: Start difference. First operand 348 states and 510 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:45,161 INFO L93 Difference]: Finished difference Result 730 states and 1068 transitions. [2023-12-19 16:02:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:02:45,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-19 16:02:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:45,163 INFO L225 Difference]: With dead ends: 730 [2023-12-19 16:02:45,163 INFO L226 Difference]: Without dead ends: 428 [2023-12-19 16:02:45,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:02:45,165 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 252 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:45,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 514 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-19 16:02:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 342. [2023-12-19 16:02:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 310 states have (on average 1.4225806451612903) internal successors, (441), 310 states have internal predecessors, (441), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 495 transitions. [2023-12-19 16:02:45,195 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 495 transitions. Word has length 96 [2023-12-19 16:02:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:45,195 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 495 transitions. [2023-12-19 16:02:45,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 495 transitions. [2023-12-19 16:02:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 16:02:45,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:45,196 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:45,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 16:02:45,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:45,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash 229362181, now seen corresponding path program 1 times [2023-12-19 16:02:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609105142] [2023-12-19 16:02:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609105142] [2023-12-19 16:02:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609105142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:02:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172302599] [2023-12-19 16:02:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:45,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:02:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:02:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:02:45,858 INFO L87 Difference]: Start difference. First operand 342 states and 495 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:46,656 INFO L93 Difference]: Finished difference Result 872 states and 1277 transitions. [2023-12-19 16:02:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 16:02:46,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-19 16:02:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:46,659 INFO L225 Difference]: With dead ends: 872 [2023-12-19 16:02:46,659 INFO L226 Difference]: Without dead ends: 576 [2023-12-19 16:02:46,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2023-12-19 16:02:46,661 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 419 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:46,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1176 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:02:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2023-12-19 16:02:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 378. [2023-12-19 16:02:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 346 states have (on average 1.4479768786127167) internal successors, (501), 346 states have internal predecessors, (501), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 555 transitions. [2023-12-19 16:02:46,693 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 555 transitions. Word has length 96 [2023-12-19 16:02:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:46,693 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 555 transitions. [2023-12-19 16:02:46,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 555 transitions. [2023-12-19 16:02:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 16:02:46,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:46,695 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:46,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 16:02:46,695 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:46,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 369910791, now seen corresponding path program 1 times [2023-12-19 16:02:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:46,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633969505] [2023-12-19 16:02:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:47,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:47,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633969505] [2023-12-19 16:02:47,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633969505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:47,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:47,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:02:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33858696] [2023-12-19 16:02:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:47,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:02:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:02:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:02:47,191 INFO L87 Difference]: Start difference. First operand 378 states and 555 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:47,880 INFO L93 Difference]: Finished difference Result 1328 states and 1942 transitions. [2023-12-19 16:02:47,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 16:02:47,881 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-19 16:02:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:47,885 INFO L225 Difference]: With dead ends: 1328 [2023-12-19 16:02:47,885 INFO L226 Difference]: Without dead ends: 996 [2023-12-19 16:02:47,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2023-12-19 16:02:47,888 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 597 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:47,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 957 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:02:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2023-12-19 16:02:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 446. [2023-12-19 16:02:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 414 states have (on average 1.4855072463768115) internal successors, (615), 414 states have internal predecessors, (615), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 669 transitions. [2023-12-19 16:02:47,921 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 669 transitions. Word has length 96 [2023-12-19 16:02:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:47,922 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 669 transitions. [2023-12-19 16:02:47,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 669 transitions. [2023-12-19 16:02:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 16:02:47,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:47,923 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 16:02:47,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:47,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1164231875, now seen corresponding path program 1 times [2023-12-19 16:02:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757425233] [2023-12-19 16:02:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:48,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757425233] [2023-12-19 16:02:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757425233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:48,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:48,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 16:02:48,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209808241] [2023-12-19 16:02:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:48,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 16:02:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 16:02:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:02:48,490 INFO L87 Difference]: Start difference. First operand 446 states and 669 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:49,334 INFO L93 Difference]: Finished difference Result 1168 states and 1736 transitions. [2023-12-19 16:02:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 16:02:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2023-12-19 16:02:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:49,338 INFO L225 Difference]: With dead ends: 1168 [2023-12-19 16:02:49,338 INFO L226 Difference]: Without dead ends: 750 [2023-12-19 16:02:49,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2023-12-19 16:02:49,339 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 590 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:49,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1415 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:02:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2023-12-19 16:02:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 450. [2023-12-19 16:02:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 418 states have (on average 1.4736842105263157) internal successors, (616), 418 states have internal predecessors, (616), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2023-12-19 16:02:49,372 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 96 [2023-12-19 16:02:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:49,373 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2023-12-19 16:02:49,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2023-12-19 16:02:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-19 16:02:49,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:49,374 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:49,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 16:02:49,374 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:49,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1801106282, now seen corresponding path program 1 times [2023-12-19 16:02:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:49,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195637698] [2023-12-19 16:02:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:49,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:49,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195637698] [2023-12-19 16:02:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195637698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:49,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 16:02:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348698780] [2023-12-19 16:02:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:49,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 16:02:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:49,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 16:02:49,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:02:49,966 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:50,834 INFO L93 Difference]: Finished difference Result 1164 states and 1731 transitions. [2023-12-19 16:02:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 16:02:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-12-19 16:02:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:50,837 INFO L225 Difference]: With dead ends: 1164 [2023-12-19 16:02:50,837 INFO L226 Difference]: Without dead ends: 760 [2023-12-19 16:02:50,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2023-12-19 16:02:50,841 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 503 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:50,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1233 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:02:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2023-12-19 16:02:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 465. [2023-12-19 16:02:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 433 states have (on average 1.4849884526558892) internal successors, (643), 433 states have internal predecessors, (643), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 697 transitions. [2023-12-19 16:02:50,873 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 697 transitions. Word has length 97 [2023-12-19 16:02:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:50,874 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 697 transitions. [2023-12-19 16:02:50,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 697 transitions. [2023-12-19 16:02:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-19 16:02:50,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:50,875 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:50,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 16:02:50,875 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:50,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash 983457832, now seen corresponding path program 1 times [2023-12-19 16:02:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:50,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982526121] [2023-12-19 16:02:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:51,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:51,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982526121] [2023-12-19 16:02:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982526121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:51,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 16:02:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847462104] [2023-12-19 16:02:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:51,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 16:02:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:51,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 16:02:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:02:51,664 INFO L87 Difference]: Start difference. First operand 465 states and 697 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:52,619 INFO L93 Difference]: Finished difference Result 1210 states and 1807 transitions. [2023-12-19 16:02:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 16:02:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2023-12-19 16:02:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:52,623 INFO L225 Difference]: With dead ends: 1210 [2023-12-19 16:02:52,623 INFO L226 Difference]: Without dead ends: 791 [2023-12-19 16:02:52,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2023-12-19 16:02:52,625 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 586 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:52,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 876 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:02:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-12-19 16:02:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 471. [2023-12-19 16:02:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 439 states have (on average 1.4851936218678816) internal successors, (652), 439 states have internal predecessors, (652), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 706 transitions. [2023-12-19 16:02:52,662 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 706 transitions. Word has length 97 [2023-12-19 16:02:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:52,662 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 706 transitions. [2023-12-19 16:02:52,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 706 transitions. [2023-12-19 16:02:52,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-19 16:02:52,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:52,664 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:52,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 16:02:52,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:52,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1863145896, now seen corresponding path program 1 times [2023-12-19 16:02:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308054305] [2023-12-19 16:02:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308054305] [2023-12-19 16:02:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308054305] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:53,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:53,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:02:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498239039] [2023-12-19 16:02:53,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:53,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:02:53,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:53,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:02:53,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:02:53,138 INFO L87 Difference]: Start difference. First operand 471 states and 706 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:53,813 INFO L93 Difference]: Finished difference Result 1387 states and 2067 transitions. [2023-12-19 16:02:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 16:02:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-12-19 16:02:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:53,818 INFO L225 Difference]: With dead ends: 1387 [2023-12-19 16:02:53,818 INFO L226 Difference]: Without dead ends: 962 [2023-12-19 16:02:53,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-12-19 16:02:53,819 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 484 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:53,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1112 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:02:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2023-12-19 16:02:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 490. [2023-12-19 16:02:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 458 states have (on average 1.4868995633187774) internal successors, (681), 458 states have internal predecessors, (681), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 735 transitions. [2023-12-19 16:02:53,850 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 735 transitions. Word has length 97 [2023-12-19 16:02:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:53,850 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 735 transitions. [2023-12-19 16:02:53,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 735 transitions. [2023-12-19 16:02:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-19 16:02:53,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:53,852 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 16:02:53,852 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:53,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1045497446, now seen corresponding path program 1 times [2023-12-19 16:02:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746194851] [2023-12-19 16:02:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:54,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746194851] [2023-12-19 16:02:54,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746194851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:54,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:54,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 16:02:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728827195] [2023-12-19 16:02:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:54,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 16:02:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:54,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 16:02:54,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:02:54,645 INFO L87 Difference]: Start difference. First operand 490 states and 735 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:55,234 INFO L93 Difference]: Finished difference Result 1091 states and 1636 transitions. [2023-12-19 16:02:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:02:55,235 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2023-12-19 16:02:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:55,237 INFO L225 Difference]: With dead ends: 1091 [2023-12-19 16:02:55,237 INFO L226 Difference]: Without dead ends: 647 [2023-12-19 16:02:55,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-12-19 16:02:55,239 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 504 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:55,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 620 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:02:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2023-12-19 16:02:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 450. [2023-12-19 16:02:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 418 states have (on average 1.4736842105263157) internal successors, (616), 418 states have internal predecessors, (616), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2023-12-19 16:02:55,268 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 97 [2023-12-19 16:02:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:55,268 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2023-12-19 16:02:55,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2023-12-19 16:02:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-19 16:02:55,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:55,269 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:55,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 16:02:55,269 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:55,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash 986042152, now seen corresponding path program 1 times [2023-12-19 16:02:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846642896] [2023-12-19 16:02:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846642896] [2023-12-19 16:02:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846642896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:56,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 16:02:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694013727] [2023-12-19 16:02:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:56,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 16:02:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 16:02:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:02:56,247 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:56,532 INFO L93 Difference]: Finished difference Result 858 states and 1282 transitions. [2023-12-19 16:02:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:02:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2023-12-19 16:02:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:56,534 INFO L225 Difference]: With dead ends: 858 [2023-12-19 16:02:56,534 INFO L226 Difference]: Without dead ends: 454 [2023-12-19 16:02:56,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:02:56,536 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 152 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:56,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 442 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-12-19 16:02:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 450. [2023-12-19 16:02:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 418 states have (on average 1.4665071770334928) internal successors, (613), 418 states have internal predecessors, (613), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 667 transitions. [2023-12-19 16:02:56,563 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 667 transitions. Word has length 97 [2023-12-19 16:02:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:56,563 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 667 transitions. [2023-12-19 16:02:56,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 667 transitions. [2023-12-19 16:02:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 16:02:56,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:56,565 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:56,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 16:02:56,565 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:56,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:56,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1833906287, now seen corresponding path program 1 times [2023-12-19 16:02:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48843003] [2023-12-19 16:02:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:57,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:57,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48843003] [2023-12-19 16:02:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48843003] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 16:02:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806154512] [2023-12-19 16:02:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:57,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 16:02:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 16:02:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:02:57,198 INFO L87 Difference]: Start difference. First operand 450 states and 667 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:58,011 INFO L93 Difference]: Finished difference Result 1088 states and 1615 transitions. [2023-12-19 16:02:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 16:02:58,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-19 16:02:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:58,016 INFO L225 Difference]: With dead ends: 1088 [2023-12-19 16:02:58,016 INFO L226 Difference]: Without dead ends: 684 [2023-12-19 16:02:58,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2023-12-19 16:02:58,019 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 418 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:58,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1331 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 16:02:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-12-19 16:02:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 453. [2023-12-19 16:02:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 421 states have (on average 1.4703087885985748) internal successors, (619), 421 states have internal predecessors, (619), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 673 transitions. [2023-12-19 16:02:58,049 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 673 transitions. Word has length 98 [2023-12-19 16:02:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:58,049 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 673 transitions. [2023-12-19 16:02:58,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:02:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 673 transitions. [2023-12-19 16:02:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 16:02:58,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:58,051 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:58,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 16:02:58,051 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:58,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -737782019, now seen corresponding path program 1 times [2023-12-19 16:02:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236495186] [2023-12-19 16:02:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:58,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:58,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236495186] [2023-12-19 16:02:58,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236495186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:58,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:58,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 16:02:58,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953914988] [2023-12-19 16:02:58,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:58,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 16:02:58,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 16:02:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-19 16:02:58,274 INFO L87 Difference]: Start difference. First operand 453 states and 673 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:02:58,592 INFO L93 Difference]: Finished difference Result 1073 states and 1579 transitions. [2023-12-19 16:02:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:02:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2023-12-19 16:02:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:02:58,595 INFO L225 Difference]: With dead ends: 1073 [2023-12-19 16:02:58,595 INFO L226 Difference]: Without dead ends: 666 [2023-12-19 16:02:58,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-12-19 16:02:58,596 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 432 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:02:58,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 469 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:02:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-12-19 16:02:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 445. [2023-12-19 16:02:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 413 states have internal predecessors, (600), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:02:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 654 transitions. [2023-12-19 16:02:58,626 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 654 transitions. Word has length 98 [2023-12-19 16:02:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:02:58,627 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 654 transitions. [2023-12-19 16:02:58,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:02:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 654 transitions. [2023-12-19 16:02:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 16:02:58,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:02:58,628 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:02:58,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 16:02:58,628 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:02:58,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:02:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2038359183, now seen corresponding path program 1 times [2023-12-19 16:02:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:02:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145393432] [2023-12-19 16:02:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:02:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:02:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:02:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:02:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:02:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:02:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:02:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:02:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:02:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:02:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:02:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:02:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:02:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:02:59,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145393432] [2023-12-19 16:02:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145393432] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:02:59,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:02:59,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:02:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46305312] [2023-12-19 16:02:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:02:59,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:02:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:02:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:02:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:02:59,306 INFO L87 Difference]: Start difference. First operand 445 states and 654 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:00,069 INFO L93 Difference]: Finished difference Result 1053 states and 1548 transitions. [2023-12-19 16:03:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 16:03:00,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-19 16:03:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:00,072 INFO L225 Difference]: With dead ends: 1053 [2023-12-19 16:03:00,072 INFO L226 Difference]: Without dead ends: 654 [2023-12-19 16:03:00,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2023-12-19 16:03:00,073 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 399 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:00,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1156 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:03:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2023-12-19 16:03:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 439. [2023-12-19 16:03:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 407 states have (on average 1.4447174447174447) internal successors, (588), 407 states have internal predecessors, (588), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:03:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 642 transitions. [2023-12-19 16:03:00,105 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 642 transitions. Word has length 98 [2023-12-19 16:03:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:00,105 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 642 transitions. [2023-12-19 16:03:00,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 642 transitions. [2023-12-19 16:03:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 16:03:00,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:00,106 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:00,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 16:03:00,106 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:00,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash -537832975, now seen corresponding path program 1 times [2023-12-19 16:03:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:00,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506442044] [2023-12-19 16:03:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506442044] [2023-12-19 16:03:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506442044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:00,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:00,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:03:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019827461] [2023-12-19 16:03:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:00,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:03:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:00,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:03:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:03:00,546 INFO L87 Difference]: Start difference. First operand 439 states and 642 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:01,021 INFO L93 Difference]: Finished difference Result 1227 states and 1786 transitions. [2023-12-19 16:03:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 16:03:01,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-19 16:03:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:01,025 INFO L225 Difference]: With dead ends: 1227 [2023-12-19 16:03:01,025 INFO L226 Difference]: Without dead ends: 834 [2023-12-19 16:03:01,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-19 16:03:01,029 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 478 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:01,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 833 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2023-12-19 16:03:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 451. [2023-12-19 16:03:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 419 states have (on average 1.4463007159904535) internal successors, (606), 419 states have internal predecessors, (606), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:03:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 660 transitions. [2023-12-19 16:03:01,077 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 660 transitions. Word has length 98 [2023-12-19 16:03:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:01,077 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 660 transitions. [2023-12-19 16:03:01,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 660 transitions. [2023-12-19 16:03:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 16:03:01,079 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:01,079 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:01,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 16:03:01,079 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:01,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash -115131149, now seen corresponding path program 1 times [2023-12-19 16:03:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239843214] [2023-12-19 16:03:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:01,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:01,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239843214] [2023-12-19 16:03:01,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239843214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:01,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:03:01,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178646625] [2023-12-19 16:03:01,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:01,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:03:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:03:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:03:01,882 INFO L87 Difference]: Start difference. First operand 451 states and 660 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:02,486 INFO L93 Difference]: Finished difference Result 1006 states and 1474 transitions. [2023-12-19 16:03:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:03:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2023-12-19 16:03:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:02,489 INFO L225 Difference]: With dead ends: 1006 [2023-12-19 16:03:02,489 INFO L226 Difference]: Without dead ends: 601 [2023-12-19 16:03:02,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2023-12-19 16:03:02,490 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 610 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:02,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 623 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:03:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2023-12-19 16:03:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 375. [2023-12-19 16:03:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 343 states have (on average 1.41399416909621) internal successors, (485), 343 states have internal predecessors, (485), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:03:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 539 transitions. [2023-12-19 16:03:02,521 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 539 transitions. Word has length 98 [2023-12-19 16:03:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:02,522 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 539 transitions. [2023-12-19 16:03:02,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 539 transitions. [2023-12-19 16:03:02,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 16:03:02,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:02,523 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:02,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 16:03:02,523 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:02,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash -668430481, now seen corresponding path program 1 times [2023-12-19 16:03:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132948262] [2023-12-19 16:03:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132948262] [2023-12-19 16:03:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132948262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:03:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780155564] [2023-12-19 16:03:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:02,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:03:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:03:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:03:02,967 INFO L87 Difference]: Start difference. First operand 375 states and 539 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:03,706 INFO L93 Difference]: Finished difference Result 1099 states and 1578 transitions. [2023-12-19 16:03:03,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 16:03:03,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-19 16:03:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:03,709 INFO L225 Difference]: With dead ends: 1099 [2023-12-19 16:03:03,709 INFO L226 Difference]: Without dead ends: 770 [2023-12-19 16:03:03,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2023-12-19 16:03:03,710 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 442 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:03,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1535 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:03:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2023-12-19 16:03:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 381. [2023-12-19 16:03:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 349 states have (on average 1.4068767908309456) internal successors, (491), 349 states have internal predecessors, (491), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:03:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 545 transitions. [2023-12-19 16:03:03,742 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 545 transitions. Word has length 98 [2023-12-19 16:03:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:03,742 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 545 transitions. [2023-12-19 16:03:03,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 545 transitions. [2023-12-19 16:03:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 16:03:03,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:03,743 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:03,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 16:03:03,743 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:03,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash -245728655, now seen corresponding path program 1 times [2023-12-19 16:03:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91591459] [2023-12-19 16:03:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:04,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91591459] [2023-12-19 16:03:04,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91591459] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:04,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:04,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 16:03:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165456880] [2023-12-19 16:03:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:04,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 16:03:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 16:03:04,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 16:03:04,180 INFO L87 Difference]: Start difference. First operand 381 states and 545 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:04,461 INFO L93 Difference]: Finished difference Result 772 states and 1115 transitions. [2023-12-19 16:03:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:03:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2023-12-19 16:03:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:04,463 INFO L225 Difference]: With dead ends: 772 [2023-12-19 16:03:04,463 INFO L226 Difference]: Without dead ends: 437 [2023-12-19 16:03:04,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-19 16:03:04,464 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 199 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:04,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 796 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:03:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-12-19 16:03:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 332. [2023-12-19 16:03:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 300 states have (on average 1.3966666666666667) internal successors, (419), 300 states have internal predecessors, (419), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:03:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 473 transitions. [2023-12-19 16:03:04,493 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 473 transitions. Word has length 98 [2023-12-19 16:03:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:04,493 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 473 transitions. [2023-12-19 16:03:04,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 473 transitions. [2023-12-19 16:03:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 16:03:04,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:04,494 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:04,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 16:03:04,494 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:04,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1076757758, now seen corresponding path program 1 times [2023-12-19 16:03:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:04,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381087021] [2023-12-19 16:03:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:04,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381087021] [2023-12-19 16:03:04,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381087021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:04,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:03:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005971663] [2023-12-19 16:03:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:04,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:03:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:03:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:03:04,587 INFO L87 Difference]: Start difference. First operand 332 states and 473 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:04,640 INFO L93 Difference]: Finished difference Result 646 states and 922 transitions. [2023-12-19 16:03:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 16:03:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2023-12-19 16:03:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:04,641 INFO L225 Difference]: With dead ends: 646 [2023-12-19 16:03:04,642 INFO L226 Difference]: Without dead ends: 360 [2023-12-19 16:03:04,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:03:04,643 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:04,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 517 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:03:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-19 16:03:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 338. [2023-12-19 16:03:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 306 states have (on average 1.3888888888888888) internal successors, (425), 306 states have internal predecessors, (425), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:03:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 479 transitions. [2023-12-19 16:03:04,670 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 479 transitions. Word has length 99 [2023-12-19 16:03:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:04,670 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 479 transitions. [2023-12-19 16:03:04,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 479 transitions. [2023-12-19 16:03:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 16:03:04,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:04,671 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:04,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 16:03:04,671 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:04,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash -283447773, now seen corresponding path program 1 times [2023-12-19 16:03:04,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:04,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404180145] [2023-12-19 16:03:04,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:04,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404180145] [2023-12-19 16:03:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404180145] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:05,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:05,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:03:05,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385547560] [2023-12-19 16:03:05,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:05,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:03:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:03:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:05,024 INFO L87 Difference]: Start difference. First operand 338 states and 479 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:05,462 INFO L93 Difference]: Finished difference Result 625 states and 893 transitions. [2023-12-19 16:03:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:03:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2023-12-19 16:03:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:05,464 INFO L225 Difference]: With dead ends: 625 [2023-12-19 16:03:05,464 INFO L226 Difference]: Without dead ends: 446 [2023-12-19 16:03:05,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-12-19 16:03:05,464 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 386 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:05,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 868 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-12-19 16:03:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 355. [2023-12-19 16:03:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 323 states have (on average 1.411764705882353) internal successors, (456), 323 states have internal predecessors, (456), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-19 16:03:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 510 transitions. [2023-12-19 16:03:05,494 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 510 transitions. Word has length 99 [2023-12-19 16:03:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:05,494 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 510 transitions. [2023-12-19 16:03:05,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 510 transitions. [2023-12-19 16:03:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 16:03:05,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:05,495 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:05,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-19 16:03:05,495 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:05,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:05,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1294565023, now seen corresponding path program 1 times [2023-12-19 16:03:05,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:05,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773118110] [2023-12-19 16:03:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773118110] [2023-12-19 16:03:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773118110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:03:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016747217] [2023-12-19 16:03:06,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:03:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:03:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:03:06,504 INFO L87 Difference]: Start difference. First operand 355 states and 510 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 16:03:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:06,756 INFO L93 Difference]: Finished difference Result 690 states and 998 transitions. [2023-12-19 16:03:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 16:03:06,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2023-12-19 16:03:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:06,758 INFO L225 Difference]: With dead ends: 690 [2023-12-19 16:03:06,758 INFO L226 Difference]: Without dead ends: 498 [2023-12-19 16:03:06,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:06,759 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 332 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:06,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 473 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:03:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-19 16:03:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 483. [2023-12-19 16:03:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 441 states have (on average 1.4036281179138321) internal successors, (619), 441 states have internal predecessors, (619), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 691 transitions. [2023-12-19 16:03:06,799 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 691 transitions. Word has length 99 [2023-12-19 16:03:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:06,799 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 691 transitions. [2023-12-19 16:03:06,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 16:03:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 691 transitions. [2023-12-19 16:03:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:06,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:06,800 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:06,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 16:03:06,801 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:06,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1636658920, now seen corresponding path program 1 times [2023-12-19 16:03:06,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:06,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200583078] [2023-12-19 16:03:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:07,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200583078] [2023-12-19 16:03:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200583078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:07,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:07,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:03:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547826757] [2023-12-19 16:03:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:07,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:03:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:03:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:03:07,017 INFO L87 Difference]: Start difference. First operand 483 states and 691 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:07,297 INFO L93 Difference]: Finished difference Result 992 states and 1422 transitions. [2023-12-19 16:03:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:03:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2023-12-19 16:03:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:07,300 INFO L225 Difference]: With dead ends: 992 [2023-12-19 16:03:07,300 INFO L226 Difference]: Without dead ends: 668 [2023-12-19 16:03:07,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-19 16:03:07,301 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 411 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:07,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 680 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:03:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-12-19 16:03:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 500. [2023-12-19 16:03:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 458 states have (on average 1.4126637554585153) internal successors, (647), 458 states have internal predecessors, (647), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 719 transitions. [2023-12-19 16:03:07,352 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 719 transitions. Word has length 100 [2023-12-19 16:03:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:07,352 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 719 transitions. [2023-12-19 16:03:07,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 719 transitions. [2023-12-19 16:03:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:07,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:07,353 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 16:03:07,354 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:07,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1647191126, now seen corresponding path program 1 times [2023-12-19 16:03:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:07,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305536019] [2023-12-19 16:03:07,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:07,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:08,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:08,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305536019] [2023-12-19 16:03:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305536019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 16:03:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100844787] [2023-12-19 16:03:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:08,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 16:03:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:08,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 16:03:08,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-19 16:03:08,366 INFO L87 Difference]: Start difference. First operand 500 states and 719 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:08,918 INFO L93 Difference]: Finished difference Result 896 states and 1289 transitions. [2023-12-19 16:03:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:03:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2023-12-19 16:03:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:08,921 INFO L225 Difference]: With dead ends: 896 [2023-12-19 16:03:08,921 INFO L226 Difference]: Without dead ends: 559 [2023-12-19 16:03:08,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-12-19 16:03:08,923 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 381 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:08,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 738 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-12-19 16:03:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 501. [2023-12-19 16:03:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 459 states have (on average 1.4139433551198257) internal successors, (649), 459 states have internal predecessors, (649), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 721 transitions. [2023-12-19 16:03:08,964 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 721 transitions. Word has length 100 [2023-12-19 16:03:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:08,964 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 721 transitions. [2023-12-19 16:03:08,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 721 transitions. [2023-12-19 16:03:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:08,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:08,967 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:08,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 16:03:08,967 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:08,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash 852870042, now seen corresponding path program 1 times [2023-12-19 16:03:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103531839] [2023-12-19 16:03:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:09,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103531839] [2023-12-19 16:03:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103531839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:03:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248583954] [2023-12-19 16:03:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:09,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:03:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:03:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:03:09,649 INFO L87 Difference]: Start difference. First operand 501 states and 721 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:10,115 INFO L93 Difference]: Finished difference Result 974 states and 1396 transitions. [2023-12-19 16:03:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:03:10,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2023-12-19 16:03:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:10,118 INFO L225 Difference]: With dead ends: 974 [2023-12-19 16:03:10,118 INFO L226 Difference]: Without dead ends: 637 [2023-12-19 16:03:10,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2023-12-19 16:03:10,119 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 489 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:10,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 416 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2023-12-19 16:03:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 487. [2023-12-19 16:03:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 445 states have (on average 1.404494382022472) internal successors, (625), 445 states have internal predecessors, (625), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 697 transitions. [2023-12-19 16:03:10,161 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 697 transitions. Word has length 100 [2023-12-19 16:03:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:10,161 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 697 transitions. [2023-12-19 16:03:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 697 transitions. [2023-12-19 16:03:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:10,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:10,162 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:10,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-19 16:03:10,163 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:10,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash -158247208, now seen corresponding path program 1 times [2023-12-19 16:03:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:10,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856308028] [2023-12-19 16:03:10,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:10,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856308028] [2023-12-19 16:03:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856308028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:10,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:03:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425231797] [2023-12-19 16:03:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:10,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:03:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:03:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:10,885 INFO L87 Difference]: Start difference. First operand 487 states and 697 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:11,431 INFO L93 Difference]: Finished difference Result 1410 states and 2006 transitions. [2023-12-19 16:03:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:03:11,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2023-12-19 16:03:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:11,435 INFO L225 Difference]: With dead ends: 1410 [2023-12-19 16:03:11,435 INFO L226 Difference]: Without dead ends: 1084 [2023-12-19 16:03:11,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-19 16:03:11,436 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 563 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:11,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 804 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:03:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-12-19 16:03:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 601. [2023-12-19 16:03:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 559 states have (on average 1.441860465116279) internal successors, (806), 559 states have internal predecessors, (806), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 878 transitions. [2023-12-19 16:03:11,484 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 878 transitions. Word has length 100 [2023-12-19 16:03:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:11,484 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 878 transitions. [2023-12-19 16:03:11,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 878 transitions. [2023-12-19 16:03:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:11,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:11,485 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:11,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-19 16:03:11,485 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:11,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -168198312, now seen corresponding path program 1 times [2023-12-19 16:03:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861620661] [2023-12-19 16:03:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861620661] [2023-12-19 16:03:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861620661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 16:03:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031735771] [2023-12-19 16:03:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:12,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 16:03:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:12,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 16:03:12,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-19 16:03:12,236 INFO L87 Difference]: Start difference. First operand 601 states and 878 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:12,840 INFO L93 Difference]: Finished difference Result 1383 states and 2024 transitions. [2023-12-19 16:03:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 16:03:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2023-12-19 16:03:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:12,843 INFO L225 Difference]: With dead ends: 1383 [2023-12-19 16:03:12,843 INFO L226 Difference]: Without dead ends: 963 [2023-12-19 16:03:12,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-12-19 16:03:12,844 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 474 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:12,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1015 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:03:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-12-19 16:03:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 669. [2023-12-19 16:03:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 627 states have (on average 1.470494417862839) internal successors, (922), 627 states have internal predecessors, (922), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 994 transitions. [2023-12-19 16:03:12,889 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 994 transitions. Word has length 100 [2023-12-19 16:03:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:12,889 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 994 transitions. [2023-12-19 16:03:12,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 994 transitions. [2023-12-19 16:03:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:12,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:12,890 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:12,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-19 16:03:12,891 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:12,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1179315562, now seen corresponding path program 1 times [2023-12-19 16:03:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:12,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570964429] [2023-12-19 16:03:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:14,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:14,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570964429] [2023-12-19 16:03:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570964429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:14,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:14,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:03:14,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890467428] [2023-12-19 16:03:14,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:14,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:03:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:14,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:03:14,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:14,164 INFO L87 Difference]: Start difference. First operand 669 states and 994 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 16:03:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:14,721 INFO L93 Difference]: Finished difference Result 1226 states and 1821 transitions. [2023-12-19 16:03:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:03:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 100 [2023-12-19 16:03:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:14,724 INFO L225 Difference]: With dead ends: 1226 [2023-12-19 16:03:14,724 INFO L226 Difference]: Without dead ends: 740 [2023-12-19 16:03:14,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-12-19 16:03:14,725 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 333 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:14,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 748 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2023-12-19 16:03:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 668. [2023-12-19 16:03:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 626 states have (on average 1.4664536741214058) internal successors, (918), 626 states have internal predecessors, (918), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 990 transitions. [2023-12-19 16:03:14,770 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 990 transitions. Word has length 100 [2023-12-19 16:03:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:14,770 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 990 transitions. [2023-12-19 16:03:14,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 16:03:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 990 transitions. [2023-12-19 16:03:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:14,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:14,771 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:14,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-19 16:03:14,771 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:14,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1271523880, now seen corresponding path program 1 times [2023-12-19 16:03:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:14,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812586815] [2023-12-19 16:03:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812586815] [2023-12-19 16:03:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812586815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:03:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737335079] [2023-12-19 16:03:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:15,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:03:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:03:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:15,220 INFO L87 Difference]: Start difference. First operand 668 states and 990 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:15,663 INFO L93 Difference]: Finished difference Result 1321 states and 1967 transitions. [2023-12-19 16:03:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:03:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2023-12-19 16:03:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:15,665 INFO L225 Difference]: With dead ends: 1321 [2023-12-19 16:03:15,665 INFO L226 Difference]: Without dead ends: 835 [2023-12-19 16:03:15,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-12-19 16:03:15,666 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 301 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:15,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 816 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2023-12-19 16:03:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 666. [2023-12-19 16:03:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 624 states have (on average 1.4743589743589745) internal successors, (920), 624 states have internal predecessors, (920), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 992 transitions. [2023-12-19 16:03:15,711 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 992 transitions. Word has length 100 [2023-12-19 16:03:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:15,711 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 992 transitions. [2023-12-19 16:03:15,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-19 16:03:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 992 transitions. [2023-12-19 16:03:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:15,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:15,712 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:15,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-19 16:03:15,713 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:15,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2012326166, now seen corresponding path program 1 times [2023-12-19 16:03:15,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:15,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92096919] [2023-12-19 16:03:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:16,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92096919] [2023-12-19 16:03:16,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92096919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:16,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:16,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:03:16,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765998760] [2023-12-19 16:03:16,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:16,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:03:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:03:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:16,661 INFO L87 Difference]: Start difference. First operand 666 states and 992 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:17,104 INFO L93 Difference]: Finished difference Result 1165 states and 1747 transitions. [2023-12-19 16:03:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 16:03:17,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2023-12-19 16:03:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:17,107 INFO L225 Difference]: With dead ends: 1165 [2023-12-19 16:03:17,107 INFO L226 Difference]: Without dead ends: 687 [2023-12-19 16:03:17,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2023-12-19 16:03:17,108 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 314 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:17,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 641 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-19 16:03:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 664. [2023-12-19 16:03:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 622 states have (on average 1.472668810289389) internal successors, (916), 622 states have internal predecessors, (916), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 988 transitions. [2023-12-19 16:03:17,150 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 988 transitions. Word has length 100 [2023-12-19 16:03:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:17,150 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 988 transitions. [2023-12-19 16:03:17,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 988 transitions. [2023-12-19 16:03:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:17,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:17,151 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:17,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-19 16:03:17,151 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:17,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1218005082, now seen corresponding path program 1 times [2023-12-19 16:03:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694796114] [2023-12-19 16:03:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:18,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694796114] [2023-12-19 16:03:18,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694796114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:18,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:18,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-19 16:03:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923905478] [2023-12-19 16:03:18,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:18,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 16:03:18,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:18,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 16:03:18,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-19 16:03:18,650 INFO L87 Difference]: Start difference. First operand 664 states and 988 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:19,668 INFO L93 Difference]: Finished difference Result 1311 states and 1936 transitions. [2023-12-19 16:03:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 16:03:19,669 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2023-12-19 16:03:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:19,671 INFO L225 Difference]: With dead ends: 1311 [2023-12-19 16:03:19,671 INFO L226 Difference]: Without dead ends: 833 [2023-12-19 16:03:19,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-12-19 16:03:19,672 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 783 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:19,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 983 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 16:03:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2023-12-19 16:03:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 667. [2023-12-19 16:03:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 625 states have (on average 1.4752) internal successors, (922), 625 states have internal predecessors, (922), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 994 transitions. [2023-12-19 16:03:19,715 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 994 transitions. Word has length 100 [2023-12-19 16:03:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:19,716 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 994 transitions. [2023-12-19 16:03:19,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 994 transitions. [2023-12-19 16:03:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-19 16:03:19,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:19,717 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:19,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-19 16:03:19,717 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:19,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 206887832, now seen corresponding path program 1 times [2023-12-19 16:03:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291853265] [2023-12-19 16:03:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291853265] [2023-12-19 16:03:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291853265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:21,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:21,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 16:03:21,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629781478] [2023-12-19 16:03:21,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:21,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 16:03:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:21,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 16:03:21,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-19 16:03:21,070 INFO L87 Difference]: Start difference. First operand 667 states and 994 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:21,807 INFO L93 Difference]: Finished difference Result 1162 states and 1741 transitions. [2023-12-19 16:03:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:03:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2023-12-19 16:03:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:21,809 INFO L225 Difference]: With dead ends: 1162 [2023-12-19 16:03:21,809 INFO L226 Difference]: Without dead ends: 684 [2023-12-19 16:03:21,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-19 16:03:21,810 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 290 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:21,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 645 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 16:03:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-12-19 16:03:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 664. [2023-12-19 16:03:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 622 states have (on average 1.472668810289389) internal successors, (916), 622 states have internal predecessors, (916), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 16:03:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 988 transitions. [2023-12-19 16:03:21,853 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 988 transitions. Word has length 100 [2023-12-19 16:03:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:21,853 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 988 transitions. [2023-12-19 16:03:21,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-19 16:03:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 988 transitions. [2023-12-19 16:03:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 16:03:21,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:21,854 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:21,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-19 16:03:21,854 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:21,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash -797687357, now seen corresponding path program 1 times [2023-12-19 16:03:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723266542] [2023-12-19 16:03:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723266542] [2023-12-19 16:03:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723266542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-19 16:03:23,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864910652] [2023-12-19 16:03:23,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:23,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-19 16:03:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-19 16:03:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-19 16:03:23,161 INFO L87 Difference]: Start difference. First operand 664 states and 988 transitions. Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 17 states have internal predecessors, (59), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 16:03:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:24,133 INFO L93 Difference]: Finished difference Result 1641 states and 2405 transitions. [2023-12-19 16:03:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 16:03:24,136 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 17 states have internal predecessors, (59), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 101 [2023-12-19 16:03:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:24,140 INFO L225 Difference]: With dead ends: 1641 [2023-12-19 16:03:24,140 INFO L226 Difference]: Without dead ends: 1023 [2023-12-19 16:03:24,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2023-12-19 16:03:24,142 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 884 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:24,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1061 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:03:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2023-12-19 16:03:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 851. [2023-12-19 16:03:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 800 states have (on average 1.43375) internal successors, (1147), 803 states have internal predecessors, (1147), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-19 16:03:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1231 transitions. [2023-12-19 16:03:24,210 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1231 transitions. Word has length 101 [2023-12-19 16:03:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:24,210 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1231 transitions. [2023-12-19 16:03:24,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 17 states have internal predecessors, (59), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-19 16:03:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1231 transitions. [2023-12-19 16:03:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 16:03:24,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:24,211 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:24,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-19 16:03:24,211 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:24,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash -855005241, now seen corresponding path program 1 times [2023-12-19 16:03:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074573940] [2023-12-19 16:03:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 16:03:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 16:03:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 16:03:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 16:03:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 16:03:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 16:03:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 16:03:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 16:03:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 16:03:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:03:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-19 16:03:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:03:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074573940] [2023-12-19 16:03:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074573940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:03:25,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:03:25,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 16:03:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162223342] [2023-12-19 16:03:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:03:25,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 16:03:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:03:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 16:03:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-19 16:03:25,929 INFO L87 Difference]: Start difference. First operand 851 states and 1231 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 16:03:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:03:26,828 INFO L93 Difference]: Finished difference Result 863 states and 1245 transitions. [2023-12-19 16:03:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 16:03:26,829 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2023-12-19 16:03:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:03:26,833 INFO L225 Difference]: With dead ends: 863 [2023-12-19 16:03:26,833 INFO L226 Difference]: Without dead ends: 861 [2023-12-19 16:03:26,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2023-12-19 16:03:26,834 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 522 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 16:03:26,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 815 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 16:03:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-12-19 16:03:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 855. [2023-12-19 16:03:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 804 states have (on average 1.431592039800995) internal successors, (1151), 807 states have internal predecessors, (1151), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-19 16:03:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1235 transitions. [2023-12-19 16:03:26,900 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1235 transitions. Word has length 101 [2023-12-19 16:03:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:03:26,900 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1235 transitions. [2023-12-19 16:03:26,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-19 16:03:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1235 transitions. [2023-12-19 16:03:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 16:03:26,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:03:26,901 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:26,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-19 16:03:26,901 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:03:26,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:03:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -854945659, now seen corresponding path program 1 times [2023-12-19 16:03:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:03:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996653557] [2023-12-19 16:03:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:03:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:03:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 16:03:26,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 16:03:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 16:03:27,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 16:03:27,076 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 16:03:27,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 16:03:27,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-19 16:03:27,081 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:03:27,084 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 16:03:27,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:03:27 BoogieIcfgContainer [2023-12-19 16:03:27,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 16:03:27,204 INFO L158 Benchmark]: Toolchain (without parser) took 56124.55ms. Allocated memory was 248.5MB in the beginning and 858.8MB in the end (delta: 610.3MB). Free memory was 206.1MB in the beginning and 368.5MB in the end (delta: -162.4MB). Peak memory consumption was 448.7MB. Max. memory is 8.0GB. [2023-12-19 16:03:27,205 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 248.5MB. Free memory is still 205.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 16:03:27,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.82ms. Allocated memory is still 248.5MB. Free memory was 206.1MB in the beginning and 190.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 16:03:27,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.94ms. Allocated memory is still 248.5MB. Free memory was 190.9MB in the beginning and 186.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 16:03:27,205 INFO L158 Benchmark]: Boogie Preprocessor took 69.32ms. Allocated memory is still 248.5MB. Free memory was 186.6MB in the beginning and 182.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 16:03:27,205 INFO L158 Benchmark]: RCFGBuilder took 704.37ms. Allocated memory is still 248.5MB. Free memory was 181.6MB in the beginning and 215.0MB in the end (delta: -33.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-12-19 16:03:27,205 INFO L158 Benchmark]: TraceAbstraction took 55005.51ms. Allocated memory was 248.5MB in the beginning and 858.8MB in the end (delta: 610.3MB). Free memory was 214.5MB in the beginning and 368.5MB in the end (delta: -154.1MB). Peak memory consumption was 456.0MB. Max. memory is 8.0GB. [2023-12-19 16:03:27,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 248.5MB. Free memory is still 205.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.82ms. Allocated memory is still 248.5MB. Free memory was 206.1MB in the beginning and 190.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.94ms. Allocated memory is still 248.5MB. Free memory was 190.9MB in the beginning and 186.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.32ms. Allocated memory is still 248.5MB. Free memory was 186.6MB in the beginning and 182.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 704.37ms. Allocated memory is still 248.5MB. Free memory was 181.6MB in the beginning and 215.0MB in the end (delta: -33.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 55005.51ms. Allocated memory was 248.5MB in the beginning and 858.8MB in the end (delta: 610.3MB). Free memory was 214.5MB in the beginning and 368.5MB in the end (delta: -154.1MB). Peak memory consumption was 456.0MB. Max. memory is 8.0GB. * 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 someBinaryFLOATComparisonOperation at line 113, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L54] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L55] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L63] signed long int last_1_WrapperStruct00_var_1_13 = -8; [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_13 [L110] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L96] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L103] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L121] RET updateVariables() [L122] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L67] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) [L70] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L70] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L72] COND TRUE ! (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L73] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L81] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L82] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer)); [L83] COND FALSE !(stepLocal_0 < -1) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_0=400, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_0=400, stepLocal_1=200] [L88] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1 [L113] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1 [L113] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) [L113] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113-L114] return (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.8s, OverallIterations: 44, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16282 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16277 mSDsluCounter, 32544 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26937 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20322 IncrementalHoareTripleChecker+Invalid, 20893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 5607 mSDtfsCounter, 20322 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1698 GetRequests, 1051 SyntacticMatches, 14 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=855occurred in iteration=43, InterpolantAutomatonStates: 430, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 6868 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 4373 NumberOfCodeBlocks, 4373 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4228 ConstructedInterpolants, 0 QuantifiedInterpolants, 47086 SizeOfPredicates, 8 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 44 InterpolantComputations, 42 PerfectInterpolantSequences, 6238/6336 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 [2023-12-19 16:03:27,235 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...