/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-s_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:46:07,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:46:07,370 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 15:46:07,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:46:07,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:46:07,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:46:07,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:46:07,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:46:07,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:46:07,401 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:46:07,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:46:07,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:46:07,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:46:07,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:46:07,403 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:46:07,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:46:07,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:46:07,404 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:46:07,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:46:07,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:46:07,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:46:07,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:46:07,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:46:07,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:46:07,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:46:07,415 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:46:07,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:46:07,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:46:07,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:46:07,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:46:07,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:46:07,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:46:07,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:46:07,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:46:07,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:46:07,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:46:07,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:46:07,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:46:07,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:46:07,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:46:07,419 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:46:07,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:46:07,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:46:07,420 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 15:46:07,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:46:07,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:46:07,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:46:07,626 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:46:07,627 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:46:07,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2023-12-19 15:46:08,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:46:08,892 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:46:08,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-33.i [2023-12-19 15:46:08,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f8274c6/7e6d8db78aaa4e1ba402a7e6c16358f5/FLAG19e1190a4 [2023-12-19 15:46:08,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f8274c6/7e6d8db78aaa4e1ba402a7e6c16358f5 [2023-12-19 15:46:08,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:46:08,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:46:08,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:46:08,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:46:08,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:46:08,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:46:08" (1/1) ... [2023-12-19 15:46:08,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57548e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:08, skipping insertion in model container [2023-12-19 15:46:08,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:46:08" (1/1) ... [2023-12-19 15:46:08,945 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:46:09,038 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-s_file-33.i[916,929] [2023-12-19 15:46:09,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:46:09,092 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:46:09,100 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-s_file-33.i[916,929] [2023-12-19 15:46:09,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:46:09,177 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:46:09,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09 WrapperNode [2023-12-19 15:46:09,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:46:09,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:46:09,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:46:09,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:46:09,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,253 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2023-12-19 15:46:09,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:46:09,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:46:09,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:46:09,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:46:09,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,310 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 15:46:09,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:46:09,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:46:09,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:46:09,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:46:09,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (1/1) ... [2023-12-19 15:46:09,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:46:09,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:46:09,372 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 15:46:09,378 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 15:46:09,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:46:09,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:46:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:46:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:46:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:46:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:46:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:46:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:46:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:46:09,470 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:46:09,471 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:46:09,867 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:46:09,885 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:46:09,885 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:46:09,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:46:09 BoogieIcfgContainer [2023-12-19 15:46:09,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:46:09,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:46:09,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:46:09,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:46:09,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:46:08" (1/3) ... [2023-12-19 15:46:09,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43503729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:46:09, skipping insertion in model container [2023-12-19 15:46:09,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:09" (2/3) ... [2023-12-19 15:46:09,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43503729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:46:09, skipping insertion in model container [2023-12-19 15:46:09,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:46:09" (3/3) ... [2023-12-19 15:46:09,892 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-33.i [2023-12-19 15:46:09,903 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:46:09,903 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:46:09,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:46:09,944 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;@4034652a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:46:09,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:46:09,947 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 15:46:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 15:46:09,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:09,959 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 15:46:09,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:09,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash -996512347, now seen corresponding path program 1 times [2023-12-19 15:46:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441174167] [2023-12-19 15:46:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,241 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 15:46:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441174167] [2023-12-19 15:46:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441174167] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:46:10,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009405404] [2023-12-19 15:46:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:10,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:46:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:46:10,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:46:10,281 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 15:46:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:10,322 INFO L93 Difference]: Finished difference Result 185 states and 297 transitions. [2023-12-19 15:46:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:46:10,324 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 15:46:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:10,333 INFO L225 Difference]: With dead ends: 185 [2023-12-19 15:46:10,333 INFO L226 Difference]: Without dead ends: 92 [2023-12-19 15:46:10,337 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 15:46:10,341 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 15:46:10,342 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 15:46:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-19 15:46:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-19 15:46:10,376 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 15:46:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 140 transitions. [2023-12-19 15:46:10,378 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 140 transitions. Word has length 93 [2023-12-19 15:46:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:10,397 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 140 transitions. [2023-12-19 15:46:10,398 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 15:46:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2023-12-19 15:46:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 15:46:10,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:10,401 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 15:46:10,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:46:10,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:10,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1231477927, now seen corresponding path program 1 times [2023-12-19 15:46:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:10,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001563473] [2023-12-19 15:46:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,641 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 15:46:10,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001563473] [2023-12-19 15:46:10,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001563473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:10,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:10,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:46:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054658447] [2023-12-19 15:46:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:46:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:10,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:46:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:10,645 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 15:46:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:10,695 INFO L93 Difference]: Finished difference Result 189 states and 288 transitions. [2023-12-19 15:46:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:46:10,696 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 15:46:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:10,698 INFO L225 Difference]: With dead ends: 189 [2023-12-19 15:46:10,699 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 15:46:10,699 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 15:46:10,700 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 15:46:10,700 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 15:46:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 15:46:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-19 15:46:10,712 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 15:46:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2023-12-19 15:46:10,713 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 93 [2023-12-19 15:46:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:10,713 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2023-12-19 15:46:10,713 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 15:46:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2023-12-19 15:46:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 15:46:10,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:10,714 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 15:46:10,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:46:10,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:10,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1246996645, now seen corresponding path program 1 times [2023-12-19 15:46:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:10,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437405944] [2023-12-19 15:46:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:10,848 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 15:46:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437405944] [2023-12-19 15:46:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437405944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:10,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:46:10,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198266295] [2023-12-19 15:46:10,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:10,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:46:10,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:10,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:46:10,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:10,850 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 15:46:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:10,896 INFO L93 Difference]: Finished difference Result 191 states and 288 transitions. [2023-12-19 15:46:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:46:10,899 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 15:46:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:10,901 INFO L225 Difference]: With dead ends: 191 [2023-12-19 15:46:10,901 INFO L226 Difference]: Without dead ends: 98 [2023-12-19 15:46:10,901 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 15:46:10,905 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 15:46:10,906 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 15:46:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-19 15:46:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-12-19 15:46:10,913 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 15:46:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2023-12-19 15:46:10,914 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 93 [2023-12-19 15:46:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:10,914 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2023-12-19 15:46:10,914 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 15:46:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2023-12-19 15:46:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 15:46:10,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:10,916 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 15:46:10,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:46:10,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:10,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1247056227, now seen corresponding path program 1 times [2023-12-19 15:46:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967596539] [2023-12-19 15:46:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:11,403 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 15:46:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967596539] [2023-12-19 15:46:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967596539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:11,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692981957] [2023-12-19 15:46:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:11,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:11,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:11,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:11,406 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 15:46:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:11,627 INFO L93 Difference]: Finished difference Result 262 states and 391 transitions. [2023-12-19 15:46:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:46:11,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 15:46:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:11,630 INFO L225 Difference]: With dead ends: 262 [2023-12-19 15:46:11,630 INFO L226 Difference]: Without dead ends: 167 [2023-12-19 15:46:11,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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 15:46:11,638 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 237 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:11,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 421 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:46:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-19 15:46:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 98. [2023-12-19 15:46:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 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 15:46:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2023-12-19 15:46:11,644 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 93 [2023-12-19 15:46:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:11,645 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2023-12-19 15:46:11,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 15:46:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2023-12-19 15:46:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 15:46:11,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:11,646 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 15:46:11,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:46:11,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:11,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 235938977, now seen corresponding path program 1 times [2023-12-19 15:46:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966433541] [2023-12-19 15:46:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,416 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 15:46:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966433541] [2023-12-19 15:46:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966433541] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:46:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164101849] [2023-12-19 15:46:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:46:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:46:12,420 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 15:46:12,448 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 15:46:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:12,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-19 15:46:12,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:46:12,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-19 15:46:12,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-19 15:46:12,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-19 15:46:12,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-19 15:46:12,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-19 15:46:12,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-19 15:46:13,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-19 15:46:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-19 15:46:13,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:46:13,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-19 15:46:13,221 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 15:46:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164101849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:46:13,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 15:46:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-12-19 15:46:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984665565] [2023-12-19 15:46:13,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 15:46:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-19 15:46:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-19 15:46:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-12-19 15:46:13,226 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 21 states, 18 states have (on average 5.833333333333333) internal successors, (105), 20 states have internal predecessors, (105), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2023-12-19 15:46:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:13,824 INFO L93 Difference]: Finished difference Result 301 states and 444 transitions. [2023-12-19 15:46:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 15:46:13,824 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.833333333333333) internal successors, (105), 20 states have internal predecessors, (105), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 93 [2023-12-19 15:46:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:13,826 INFO L225 Difference]: With dead ends: 301 [2023-12-19 15:46:13,826 INFO L226 Difference]: Without dead ends: 204 [2023-12-19 15:46:13,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2023-12-19 15:46:13,827 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 413 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:13,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 897 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:46:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-19 15:46:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 143. [2023-12-19 15:46:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 121 states have internal predecessors, (171), 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 15:46:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 207 transitions. [2023-12-19 15:46:13,838 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 207 transitions. Word has length 93 [2023-12-19 15:46:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:13,838 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 207 transitions. [2023-12-19 15:46:13,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.833333333333333) internal successors, (105), 20 states have internal predecessors, (105), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2023-12-19 15:46:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 207 transitions. [2023-12-19 15:46:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 15:46:13,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:13,840 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 15:46:13,856 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 15:46:14,060 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 15:46:14,060 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:14,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash -273534113, now seen corresponding path program 1 times [2023-12-19 15:46:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899722304] [2023-12-19 15:46:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:14,858 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 15:46:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899722304] [2023-12-19 15:46:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899722304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:14,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:14,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:46:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185470493] [2023-12-19 15:46:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:14,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:46:14,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:46:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:14,865 INFO L87 Difference]: Start difference. First operand 143 states and 207 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 15:46:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:15,211 INFO L93 Difference]: Finished difference Result 461 states and 683 transitions. [2023-12-19 15:46:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:46:15,211 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 15:46:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:15,213 INFO L225 Difference]: With dead ends: 461 [2023-12-19 15:46:15,213 INFO L226 Difference]: Without dead ends: 364 [2023-12-19 15:46:15,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:46:15,214 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 292 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:15,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 735 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:46:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-12-19 15:46:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 256. [2023-12-19 15:46:15,227 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 15:46:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2023-12-19 15:46:15,233 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 93 [2023-12-19 15:46:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:15,234 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2023-12-19 15:46:15,234 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 15:46:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2023-12-19 15:46:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-19 15:46:15,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:15,236 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 15:46:15,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:46:15,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:15,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash -492388831, now seen corresponding path program 1 times [2023-12-19 15:46:15,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:15,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475492464] [2023-12-19 15:46:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:15,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,414 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 15:46:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475492464] [2023-12-19 15:46:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475492464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:15,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906375777] [2023-12-19 15:46:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:15,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:15,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:15,416 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 15:46:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:15,558 INFO L93 Difference]: Finished difference Result 489 states and 733 transitions. [2023-12-19 15:46:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:46:15,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 15:46:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:15,561 INFO L225 Difference]: With dead ends: 489 [2023-12-19 15:46:15,561 INFO L226 Difference]: Without dead ends: 279 [2023-12-19 15:46:15,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:15,562 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 154 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:15,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 423 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:46:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-12-19 15:46:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 260. [2023-12-19 15:46:15,589 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 15:46:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2023-12-19 15:46:15,591 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 93 [2023-12-19 15:46:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:15,592 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2023-12-19 15:46:15,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 15:46:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2023-12-19 15:46:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-19 15:46:15,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:15,593 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 15:46:15,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:46:15,593 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:15,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1791797023, now seen corresponding path program 1 times [2023-12-19 15:46:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945364439] [2023-12-19 15:46:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,689 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 15:46:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945364439] [2023-12-19 15:46:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945364439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126355890] [2023-12-19 15:46:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:15,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:15,691 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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 15:46:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:15,871 INFO L93 Difference]: Finished difference Result 712 states and 1052 transitions. [2023-12-19 15:46:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:46:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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 15:46:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:15,874 INFO L225 Difference]: With dead ends: 712 [2023-12-19 15:46:15,874 INFO L226 Difference]: Without dead ends: 498 [2023-12-19 15:46:15,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:15,875 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 161 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:15,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 547 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:46:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-19 15:46:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 284. [2023-12-19 15:46:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.4484126984126984) internal successors, (365), 252 states have internal predecessors, (365), 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 15:46:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 419 transitions. [2023-12-19 15:46:15,893 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 419 transitions. Word has length 94 [2023-12-19 15:46:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:15,893 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 419 transitions. [2023-12-19 15:46:15,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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 15:46:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 419 transitions. [2023-12-19 15:46:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-19 15:46:15,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:15,894 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 15:46:15,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:46:15,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:15,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1221946943, now seen corresponding path program 1 times [2023-12-19 15:46:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400003344] [2023-12-19 15:46:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,000 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 15:46:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400003344] [2023-12-19 15:46:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400003344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:16,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687132987] [2023-12-19 15:46:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:16,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:16,002 INFO L87 Difference]: Start difference. First operand 284 states and 419 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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 15:46:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:16,161 INFO L93 Difference]: Finished difference Result 674 states and 996 transitions. [2023-12-19 15:46:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:46:16,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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 15:46:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:16,164 INFO L225 Difference]: With dead ends: 674 [2023-12-19 15:46:16,164 INFO L226 Difference]: Without dead ends: 436 [2023-12-19 15:46:16,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:16,166 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 167 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:16,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 423 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:46:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-19 15:46:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 284. [2023-12-19 15:46:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.4365079365079365) internal successors, (362), 252 states have internal predecessors, (362), 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 15:46:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 416 transitions. [2023-12-19 15:46:16,180 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 416 transitions. Word has length 94 [2023-12-19 15:46:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:16,181 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 416 transitions. [2023-12-19 15:46:16,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (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 15:46:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 416 transitions. [2023-12-19 15:46:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 15:46:16,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:16,182 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 15:46:16,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:46:16,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:16,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2127064964, now seen corresponding path program 1 times [2023-12-19 15:46:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:16,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11991034] [2023-12-19 15:46:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,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 15:46:16,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11991034] [2023-12-19 15:46:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11991034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:16,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909280643] [2023-12-19 15:46:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:16,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:16,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:16,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:16,587 INFO L87 Difference]: Start difference. First operand 284 states and 416 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 15:46:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:16,731 INFO L93 Difference]: Finished difference Result 663 states and 982 transitions. [2023-12-19 15:46:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:46:16,731 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 15:46:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:16,733 INFO L225 Difference]: With dead ends: 663 [2023-12-19 15:46:16,733 INFO L226 Difference]: Without dead ends: 425 [2023-12-19 15:46:16,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:46:16,734 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 162 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:16,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 397 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:46:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-12-19 15:46:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 326. [2023-12-19 15:46:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 294 states have (on average 1.445578231292517) internal successors, (425), 294 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 15:46:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2023-12-19 15:46:16,762 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 95 [2023-12-19 15:46:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:16,763 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2023-12-19 15:46:16,763 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 15:46:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2023-12-19 15:46:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 15:46:16,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:16,764 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 15:46:16,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:46:16,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:16,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1540258950, now seen corresponding path program 1 times [2023-12-19 15:46:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:16,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071525257] [2023-12-19 15:46:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:16,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:16,876 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 15:46:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071525257] [2023-12-19 15:46:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071525257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711996328] [2023-12-19 15:46:16,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:16,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:16,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:16,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:16,877 INFO L87 Difference]: Start difference. First operand 326 states and 479 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 15:46:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:16,917 INFO L93 Difference]: Finished difference Result 653 states and 967 transitions. [2023-12-19 15:46:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:46:16,918 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 15:46:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:16,920 INFO L225 Difference]: With dead ends: 653 [2023-12-19 15:46:16,920 INFO L226 Difference]: Without dead ends: 373 [2023-12-19 15:46:16,920 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 15:46:16,921 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 15:46:16,921 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 15:46:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-19 15:46:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 331. [2023-12-19 15:46:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.4381270903010033) internal successors, (430), 299 states have internal predecessors, (430), 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 15:46:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 484 transitions. [2023-12-19 15:46:16,939 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 484 transitions. Word has length 95 [2023-12-19 15:46:16,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:16,939 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 484 transitions. [2023-12-19 15:46:16,939 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 15:46:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 484 transitions. [2023-12-19 15:46:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-19 15:46:16,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:16,940 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 15:46:16,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:46:16,940 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:16,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash -186995581, now seen corresponding path program 1 times [2023-12-19 15:46:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231554247] [2023-12-19 15:46:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,262 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 15:46:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231554247] [2023-12-19 15:46:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231554247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:17,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:17,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:46:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065251243] [2023-12-19 15:46:17,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:17,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:46:17,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:17,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:46:17,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:17,263 INFO L87 Difference]: Start difference. First operand 331 states and 484 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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 15:46:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:17,414 INFO L93 Difference]: Finished difference Result 618 states and 907 transitions. [2023-12-19 15:46:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:46:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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 15:46:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:17,415 INFO L225 Difference]: With dead ends: 618 [2023-12-19 15:46:17,416 INFO L226 Difference]: Without dead ends: 333 [2023-12-19 15:46:17,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:17,416 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 98 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:17,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 235 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:46:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-19 15:46:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2023-12-19 15:46:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.434782608695652) internal successors, (429), 299 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 15:46:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 483 transitions. [2023-12-19 15:46:17,429 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 483 transitions. Word has length 95 [2023-12-19 15:46:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:17,429 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 483 transitions. [2023-12-19 15:46:17,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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 15:46:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 483 transitions. [2023-12-19 15:46:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 15:46:17,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:17,430 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 15:46:17,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:46:17,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:17,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash 521096742, now seen corresponding path program 1 times [2023-12-19 15:46:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:17,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948501217] [2023-12-19 15:46:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:17,815 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 15:46:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948501217] [2023-12-19 15:46:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948501217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:17,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:46:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173461018] [2023-12-19 15:46:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:46:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:17,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:46:17,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:46:17,816 INFO L87 Difference]: Start difference. First operand 331 states and 483 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 15:46:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:18,332 INFO L93 Difference]: Finished difference Result 780 states and 1132 transitions. [2023-12-19 15:46:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:46:18,332 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 15:46:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:18,334 INFO L225 Difference]: With dead ends: 780 [2023-12-19 15:46:18,334 INFO L226 Difference]: Without dead ends: 485 [2023-12-19 15:46:18,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:46:18,335 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 494 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:18,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 679 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:46:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-12-19 15:46:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 331. [2023-12-19 15:46:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.4180602006688963) internal successors, (424), 299 states have internal predecessors, (424), 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 15:46:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 478 transitions. [2023-12-19 15:46:18,350 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 478 transitions. Word has length 96 [2023-12-19 15:46:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:18,350 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 478 transitions. [2023-12-19 15:46:18,350 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 15:46:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 478 transitions. [2023-12-19 15:46:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-19 15:46:18,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:18,351 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 15:46:18,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:46:18,351 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:18,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2040053045, now seen corresponding path program 1 times [2023-12-19 15:46:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296781193] [2023-12-19 15:46:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:18,611 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 15:46:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296781193] [2023-12-19 15:46:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296781193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:18,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:18,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:46:18,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509350312] [2023-12-19 15:46:18,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:18,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:46:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:46:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:46:18,613 INFO L87 Difference]: Start difference. First operand 331 states and 478 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (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 15:46:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:19,057 INFO L93 Difference]: Finished difference Result 717 states and 1053 transitions. [2023-12-19 15:46:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:46:19,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (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 15:46:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:19,059 INFO L225 Difference]: With dead ends: 717 [2023-12-19 15:46:19,059 INFO L226 Difference]: Without dead ends: 432 [2023-12-19 15:46:19,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:46:19,060 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 474 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:19,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 694 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:46:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-12-19 15:46:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 331. [2023-12-19 15:46:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.4180602006688963) internal successors, (424), 299 states have internal predecessors, (424), 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 15:46:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 478 transitions. [2023-12-19 15:46:19,074 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 478 transitions. Word has length 97 [2023-12-19 15:46:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:19,074 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 478 transitions. [2023-12-19 15:46:19,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (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 15:46:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 478 transitions. [2023-12-19 15:46:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-19 15:46:19,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:19,075 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 15:46:19,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:46:19,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:19,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1439850121, now seen corresponding path program 1 times [2023-12-19 15:46:19,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:19,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503487996] [2023-12-19 15:46:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,422 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 15:46:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503487996] [2023-12-19 15:46:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503487996] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:19,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:19,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185215687] [2023-12-19 15:46:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:19,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:19,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:19,425 INFO L87 Difference]: Start difference. First operand 331 states and 478 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (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 15:46:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:19,612 INFO L93 Difference]: Finished difference Result 618 states and 895 transitions. [2023-12-19 15:46:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:46:19,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (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 15:46:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:19,613 INFO L225 Difference]: With dead ends: 618 [2023-12-19 15:46:19,614 INFO L226 Difference]: Without dead ends: 333 [2023-12-19 15:46:19,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:46:19,616 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 136 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:19,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 321 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:46:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-19 15:46:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2023-12-19 15:46:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.411371237458194) internal successors, (422), 299 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 15:46:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 476 transitions. [2023-12-19 15:46:19,630 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 476 transitions. Word has length 97 [2023-12-19 15:46:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:19,630 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 476 transitions. [2023-12-19 15:46:19,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (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 15:46:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 476 transitions. [2023-12-19 15:46:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 15:46:19,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:19,631 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 15:46:19,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:46:19,631 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:19,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1277944688, now seen corresponding path program 1 times [2023-12-19 15:46:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:19,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727769903] [2023-12-19 15:46:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:19,871 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 15:46:19,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:19,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727769903] [2023-12-19 15:46:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727769903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:19,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:19,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:46:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336992805] [2023-12-19 15:46:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:19,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:46:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:46:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:46:19,873 INFO L87 Difference]: Start difference. First operand 331 states and 476 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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 15:46:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:20,727 INFO L93 Difference]: Finished difference Result 1187 states and 1741 transitions. [2023-12-19 15:46:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:46:20,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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 15:46:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:20,731 INFO L225 Difference]: With dead ends: 1187 [2023-12-19 15:46:20,731 INFO L226 Difference]: Without dead ends: 902 [2023-12-19 15:46:20,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-19 15:46:20,732 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 391 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:20,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1312 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:46:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2023-12-19 15:46:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 652. [2023-12-19 15:46:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 600 states have (on average 1.4383333333333332) internal successors, (863), 600 states have internal predecessors, (863), 45 states have call successors, (45), 6 states have call predecessors, (45), 6 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-19 15:46:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 953 transitions. [2023-12-19 15:46:20,753 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 953 transitions. Word has length 98 [2023-12-19 15:46:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:20,754 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 953 transitions. [2023-12-19 15:46:20,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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 15:46:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 953 transitions. [2023-12-19 15:46:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 15:46:20,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:20,755 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 15:46:20,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:46:20,755 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:20,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -855242862, now seen corresponding path program 1 times [2023-12-19 15:46:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798370] [2023-12-19 15:46:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,054 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 15:46:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:21,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798370] [2023-12-19 15:46:21,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:46:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014973245] [2023-12-19 15:46:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:21,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:46:21,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:21,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:46:21,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:46:21,056 INFO L87 Difference]: Start difference. First operand 652 states and 953 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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 15:46:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:21,469 INFO L93 Difference]: Finished difference Result 1434 states and 2111 transitions. [2023-12-19 15:46:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:46:21,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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 15:46:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:21,473 INFO L225 Difference]: With dead ends: 1434 [2023-12-19 15:46:21,473 INFO L226 Difference]: Without dead ends: 828 [2023-12-19 15:46:21,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:46:21,476 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 264 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:21,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 722 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:46:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2023-12-19 15:46:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 323. [2023-12-19 15:46:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 291 states have (on average 1.4089347079037802) internal successors, (410), 291 states have internal predecessors, (410), 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 15:46:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 464 transitions. [2023-12-19 15:46:21,491 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 464 transitions. Word has length 98 [2023-12-19 15:46:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:21,493 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 464 transitions. [2023-12-19 15:46:21,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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 15:46:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 464 transitions. [2023-12-19 15:46:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 15:46:21,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:21,493 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 15:46:21,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:46:21,494 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:21,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 514685840, now seen corresponding path program 1 times [2023-12-19 15:46:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548021318] [2023-12-19 15:46:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,830 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 15:46:21,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548021318] [2023-12-19 15:46:21,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548021318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:21,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:21,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:46:21,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095898382] [2023-12-19 15:46:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:21,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:46:21,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:21,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:46:21,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:46:21,831 INFO L87 Difference]: Start difference. First operand 323 states and 464 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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 15:46:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:22,470 INFO L93 Difference]: Finished difference Result 1110 states and 1604 transitions. [2023-12-19 15:46:22,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:46:22,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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 15:46:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:22,473 INFO L225 Difference]: With dead ends: 1110 [2023-12-19 15:46:22,473 INFO L226 Difference]: Without dead ends: 833 [2023-12-19 15:46:22,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:46:22,475 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 530 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:22,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 853 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 15:46:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2023-12-19 15:46:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 360. [2023-12-19 15:46:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 328 states have (on average 1.420731707317073) internal successors, (466), 328 states have internal predecessors, (466), 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 15:46:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 520 transitions. [2023-12-19 15:46:22,490 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 520 transitions. Word has length 98 [2023-12-19 15:46:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:22,490 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 520 transitions. [2023-12-19 15:46:22,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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 15:46:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 520 transitions. [2023-12-19 15:46:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 15:46:22,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:22,491 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 15:46:22,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:46:22,491 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:22,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash -506382514, now seen corresponding path program 1 times [2023-12-19 15:46:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:22,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253411903] [2023-12-19 15:46:22,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:22,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,689 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 15:46:22,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253411903] [2023-12-19 15:46:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253411903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:22,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:46:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677910280] [2023-12-19 15:46:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:22,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:46:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:22,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:46:22,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:22,691 INFO L87 Difference]: Start difference. First operand 360 states and 520 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (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 15:46:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:22,971 INFO L93 Difference]: Finished difference Result 683 states and 999 transitions. [2023-12-19 15:46:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:46:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (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 15:46:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:22,973 INFO L225 Difference]: With dead ends: 683 [2023-12-19 15:46:22,973 INFO L226 Difference]: Without dead ends: 369 [2023-12-19 15:46:22,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:46:22,974 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 245 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:22,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 502 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:46:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-19 15:46:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 333. [2023-12-19 15:46:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 301 states have (on average 1.4285714285714286) internal successors, (430), 301 states have internal predecessors, (430), 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 15:46:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 484 transitions. [2023-12-19 15:46:22,991 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 484 transitions. Word has length 98 [2023-12-19 15:46:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:22,991 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 484 transitions. [2023-12-19 15:46:22,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (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 15:46:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 484 transitions. [2023-12-19 15:46:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 15:46:22,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:22,993 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 15:46:22,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 15:46:22,993 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:22,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash -901370785, now seen corresponding path program 1 times [2023-12-19 15:46:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707482014] [2023-12-19 15:46:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:22,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,096 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 15:46:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:23,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707482014] [2023-12-19 15:46:23,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707482014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:23,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:23,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361758947] [2023-12-19 15:46:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:23,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:23,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:23,098 INFO L87 Difference]: Start difference. First operand 333 states and 484 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 15:46:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:23,135 INFO L93 Difference]: Finished difference Result 648 states and 944 transitions. [2023-12-19 15:46:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:46:23,135 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 15:46:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:23,136 INFO L225 Difference]: With dead ends: 648 [2023-12-19 15:46:23,136 INFO L226 Difference]: Without dead ends: 361 [2023-12-19 15:46:23,137 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 15:46:23,138 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 53 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:23,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 502 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:46:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-12-19 15:46:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 339. [2023-12-19 15:46:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 307 states have (on average 1.4201954397394136) internal successors, (436), 307 states have internal predecessors, (436), 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 15:46:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 490 transitions. [2023-12-19 15:46:23,154 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 490 transitions. Word has length 99 [2023-12-19 15:46:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:23,154 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 490 transitions. [2023-12-19 15:46:23,154 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 15:46:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 490 transitions. [2023-12-19 15:46:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 15:46:23,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:23,155 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 15:46:23,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:46:23,155 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:23,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 890372388, now seen corresponding path program 1 times [2023-12-19 15:46:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:23,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153919103] [2023-12-19 15:46:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,818 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 15:46:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153919103] [2023-12-19 15:46:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153919103] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:46:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986447218] [2023-12-19 15:46:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:46:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:46:23,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:46:23,820 INFO L87 Difference]: Start difference. First operand 339 states and 490 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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 15:46:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:24,263 INFO L93 Difference]: Finished difference Result 964 states and 1377 transitions. [2023-12-19 15:46:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:46:24,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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 101 [2023-12-19 15:46:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:24,265 INFO L225 Difference]: With dead ends: 964 [2023-12-19 15:46:24,265 INFO L226 Difference]: Without dead ends: 671 [2023-12-19 15:46:24,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:46:24,267 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 228 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:24,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 811 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:46:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-12-19 15:46:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 617. [2023-12-19 15:46:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 578 states have (on average 1.4204152249134947) internal successors, (821), 580 states have internal predecessors, (821), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-19 15:46:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 883 transitions. [2023-12-19 15:46:24,285 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 883 transitions. Word has length 101 [2023-12-19 15:46:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:24,285 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 883 transitions. [2023-12-19 15:46:24,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 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 15:46:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 883 transitions. [2023-12-19 15:46:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 15:46:24,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:24,286 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 15:46:24,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 15:46:24,286 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:24,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash 833054504, now seen corresponding path program 1 times [2023-12-19 15:46:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:24,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683395858] [2023-12-19 15:46:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:46:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:46:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:46:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:46:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 15:46:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:46:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 15:46:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,020 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 15:46:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:25,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683395858] [2023-12-19 15:46:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683395858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:25,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:46:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029262415] [2023-12-19 15:46:25,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:25,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:46:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:46:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:46:25,022 INFO L87 Difference]: Start difference. First operand 617 states and 883 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 15:46:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:25,583 INFO L93 Difference]: Finished difference Result 626 states and 892 transitions. [2023-12-19 15:46:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:46:25,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 101 [2023-12-19 15:46:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:25,586 INFO L225 Difference]: With dead ends: 626 [2023-12-19 15:46:25,586 INFO L226 Difference]: Without dead ends: 624 [2023-12-19 15:46:25,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:46:25,587 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 235 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:25,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 837 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 15:46:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-12-19 15:46:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 621. [2023-12-19 15:46:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 582 states have (on average 1.4175257731958764) internal successors, (825), 584 states have internal predecessors, (825), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-19 15:46:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 887 transitions. [2023-12-19 15:46:25,604 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 887 transitions. Word has length 101 [2023-12-19 15:46:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:25,604 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 887 transitions. [2023-12-19 15:46:25,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 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 15:46:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 887 transitions. [2023-12-19 15:46:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 15:46:25,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:25,605 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 15:46:25,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 15:46:25,605 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:25,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash 833114086, now seen corresponding path program 1 times [2023-12-19 15:46:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563407539] [2023-12-19 15:46:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:46:25,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:46:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:46:25,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:46:25,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:46:25,682 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:46:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 15:46:25,700 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] [2023-12-19 15:46:25,703 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:46:25,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:46:25 BoogieIcfgContainer [2023-12-19 15:46:25,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:46:25,739 INFO L158 Benchmark]: Toolchain (without parser) took 16825.31ms. Allocated memory was 192.9MB in the beginning and 633.3MB in the end (delta: 440.4MB). Free memory was 124.7MB in the beginning and 398.5MB in the end (delta: -273.8MB). Peak memory consumption was 168.1MB. Max. memory is 8.0GB. [2023-12-19 15:46:25,739 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:46:25,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.73ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 124.5MB in the beginning and 194.9MB in the end (delta: -70.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 15:46:25,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.08ms. Allocated memory is still 231.7MB. Free memory was 194.9MB in the beginning and 193.8MB in the end (delta: 1.0MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2023-12-19 15:46:25,739 INFO L158 Benchmark]: Boogie Preprocessor took 80.84ms. Allocated memory is still 231.7MB. Free memory was 193.3MB in the beginning and 188.6MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:46:25,739 INFO L158 Benchmark]: RCFGBuilder took 550.65ms. Allocated memory is still 231.7MB. Free memory was 188.6MB in the beginning and 155.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-19 15:46:25,739 INFO L158 Benchmark]: TraceAbstraction took 15850.73ms. Allocated memory was 231.7MB in the beginning and 633.3MB in the end (delta: 401.6MB). Free memory was 154.5MB in the beginning and 398.5MB in the end (delta: -244.0MB). Peak memory consumption was 158.1MB. Max. memory is 8.0GB. [2023-12-19 15:46:25,740 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.12ms. Allocated memory is still 192.9MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.73ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 124.5MB in the beginning and 194.9MB in the end (delta: -70.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.08ms. Allocated memory is still 231.7MB. Free memory was 194.9MB in the beginning and 193.8MB in the end (delta: 1.0MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.84ms. Allocated memory is still 231.7MB. Free memory was 193.3MB in the beginning and 188.6MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 550.65ms. Allocated memory is still 231.7MB. Free memory was 188.6MB in the beginning and 155.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15850.73ms. Allocated memory was 231.7MB in the beginning and 633.3MB in the end (delta: 401.6MB). Free memory was 154.5MB in the beginning and 398.5MB in the end (delta: -244.0MB). Peak memory consumption was 158.1MB. 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 101, 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 long int last_1_WrapperStruct00_var_1_13 = -8; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR WrapperStruct00.var_1_13 [L98] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L81] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L82] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L84] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] 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}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L88] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] 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}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L90] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L91] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_12 [L92] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] 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}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L92] 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}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L93] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L109] RET updateVariables() [L110] CALL step() [L55] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L55] COND FALSE !(WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) [L58] EXPR WrapperStruct00.var_1_7 [L58] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_7 [L59] EXPR WrapperStruct00.var_1_7 [L59] unsigned char stepLocal_1 = WrapperStruct00.var_1_7; [L60] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L60] COND TRUE ! WrapperStruct00.var_1_14 [L61] EXPR WrapperStruct00.var_1_8 [L61] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_8 [L69] EXPR WrapperStruct00.var_1_11 [L69] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_11 [L70] EXPR WrapperStruct00.var_1_13 [L70] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L70] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L70] EXPR WrapperStruct00.var_1_16 [L70] signed long int stepLocal_0 = (WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16; [L71] COND FALSE !(stepLocal_0 < -1) [L74] EXPR WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_1 = (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L76] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_0=400, stepLocal_1=200] [L76] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_0=400, stepLocal_1=200] [L76] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) [L101] EXPR WrapperStruct00.var_1_1 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR (((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1 [L101] EXPR (WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_7 [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1 [L101] EXPR (WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) [L101] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_8 [L101] EXPR (! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_11 [L101] EXPR (((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] EXPR ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101-L102] return ((((((((WrapperStruct00.var_1_13 ^ WrapperStruct00.var_1_7) + WrapperStruct00.var_1_16) < -1) ? (WrapperStruct00.var_1_1 == ((signed short int) 8)) : (WrapperStruct00.var_1_1 == ((signed short int) (128 - (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7))))) && ((WrapperStruct00.var_1_5 < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_8 + 1))) : 1)) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_13 & (WrapperStruct00.var_1_7 | WrapperStruct00.var_1_16))) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) < 0 ) ? -(WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)) : (WrapperStruct00.var_1_10 + (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12)))))) : 1)) && ((! WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_7 > (WrapperStruct00.var_1_7 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_13 == ((signed long int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_15 == ((float) WrapperStruct00.var_1_11))) && (WrapperStruct00.var_1_16 == ((signed long int) WrapperStruct00.var_1_7)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, \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: 15.8s, OverallIterations: 23, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4841 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4839 mSDsluCounter, 12779 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9874 mSDsCounter, 522 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9035 IncrementalHoareTripleChecker+Invalid, 9557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 522 mSolverCounterUnsat, 2905 mSDtfsCounter, 9035 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 911 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=16, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 2372 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2301 NumberOfCodeBlocks, 2301 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2269 ConstructedInterpolants, 0 QuantifiedInterpolants, 8703 SizeOfPredicates, 5 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 3384/3456 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 15:46:25,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...