/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:43:37,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:43:37,166 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-21 01:43:37,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:43:37,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:43:37,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:43:37,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:43:37,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:43:37,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:43:37,191 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:43:37,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:43:37,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:43:37,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:43:37,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:43:37,198 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:43:37,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:43:37,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:43:37,199 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:43:37,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:43:37,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:43:37,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:43:37,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:43:37,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:43:37,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:43:37,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:43:37,204 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:43:37,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:43:37,205 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:43:37,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:43:37,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:43:37,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:43:37,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:43:37,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:43:37,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:43:37,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:43:37,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:43:37,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:43:37,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:43:37,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:43:37,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:43:37,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:43:37,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:43:37,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:43:37,210 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 -> false [2023-12-21 01:43:37,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:43:37,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:43:37,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:43:37,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:43:37,453 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:43:37,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i [2023-12-21 01:43:38,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:43:38,894 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:43:38,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-32.i [2023-12-21 01:43:38,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac16e7887/06ba0bc1a26f4516a121c72a96b5b163/FLAGe802a7019 [2023-12-21 01:43:38,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac16e7887/06ba0bc1a26f4516a121c72a96b5b163 [2023-12-21 01:43:38,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:43:38,923 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:43:38,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:43:38,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:43:38,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:43:38,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:43:38" (1/1) ... [2023-12-21 01:43:38,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d3bd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:38, skipping insertion in model container [2023-12-21 01:43:38,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:43:38" (1/1) ... [2023-12-21 01:43:38,963 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:43:39,102 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-a_file-32.i[916,929] [2023-12-21 01:43:39,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:43:39,180 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:43:39,194 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-a_file-32.i[916,929] [2023-12-21 01:43:39,243 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:43:39,271 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:43:39,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39 WrapperNode [2023-12-21 01:43:39,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:43:39,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:43:39,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:43:39,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:43:39,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,334 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2023-12-21 01:43:39,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:43:39,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:43:39,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:43:39,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:43:39,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,376 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 14, 23, 8, 24, 53]. 43 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 3, 1, 2, 4]. The 15 writes are split as follows [0, 2, 5, 2, 2, 4]. [2023-12-21 01:43:39,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:43:39,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:43:39,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:43:39,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:43:39,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (1/1) ... [2023-12-21 01:43:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:43:39,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:43:39,459 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-21 01:43:39,475 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-21 01:43:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:43:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:43:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:43:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:43:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:43:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:43:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:43:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:43:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:43:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:43:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:43:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:43:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:43:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:43:39,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:43:39,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:43:39,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:43:39,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:43:39,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:43:39,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:43:39,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:43:39,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:43:39,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:43:39,637 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:43:39,638 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:43:40,084 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:43:40,120 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:43:40,120 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:43:40,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:43:40 BoogieIcfgContainer [2023-12-21 01:43:40,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:43:40,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:43:40,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:43:40,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:43:40,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:43:38" (1/3) ... [2023-12-21 01:43:40,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6ed50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:43:40, skipping insertion in model container [2023-12-21 01:43:40,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:43:39" (2/3) ... [2023-12-21 01:43:40,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6ed50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:43:40, skipping insertion in model container [2023-12-21 01:43:40,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:43:40" (3/3) ... [2023-12-21 01:43:40,129 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-32.i [2023-12-21 01:43:40,149 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:43:40,150 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:43:40,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:43:40,193 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;@1b72c68d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:43:40,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:43:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:43:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 01:43:40,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:43:40,209 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:43:40,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:43:40,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:43:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 841249278, now seen corresponding path program 1 times [2023-12-21 01:43:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:43:40,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414472794] [2023-12-21 01:43:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:43:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:43:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:43:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:43:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:43:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:43:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:43:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:43:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:43:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:43:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:43:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:43:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:43:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:43:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:43:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:43:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:43:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:43:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:43:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:43:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:43:40,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:43:40,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414472794] [2023-12-21 01:43:40,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414472794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:43:40,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:43:40,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:43:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864991734] [2023-12-21 01:43:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:43:40,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:43:40,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:43:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:43:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:43:40,715 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:43:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:43:40,770 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2023-12-21 01:43:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:43:40,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2023-12-21 01:43:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:43:40,778 INFO L225 Difference]: With dead ends: 181 [2023-12-21 01:43:40,778 INFO L226 Difference]: Without dead ends: 90 [2023-12-21 01:43:40,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-21 01:43:40,784 INFO L413 NwaCegarLoop]: 123 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, 123 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-21 01:43:40,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:43:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-21 01:43:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-21 01:43:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:43:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2023-12-21 01:43:40,854 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 124 [2023-12-21 01:43:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:43:40,854 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2023-12-21 01:43:40,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:43:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2023-12-21 01:43:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 01:43:40,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:43:40,860 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:43:40,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:43:40,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:43:40,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:43:40,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2096020442, now seen corresponding path program 1 times [2023-12-21 01:43:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:43:40,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758975941] [2023-12-21 01:43:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:43:40,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:43:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:43:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:43:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:43:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:43:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:43:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:43:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:43:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:43:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:43:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:43:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:43:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:43:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:43:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:43:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:43:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:43:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:43:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:43:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:43:41,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:43:41,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758975941] [2023-12-21 01:43:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758975941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:43:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:43:41,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:43:41,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145580034] [2023-12-21 01:43:41,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:43:41,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:43:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:43:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:43:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:43:41,368 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:43:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:43:41,546 INFO L93 Difference]: Finished difference Result 306 states and 432 transitions. [2023-12-21 01:43:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 01:43:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2023-12-21 01:43:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:43:41,549 INFO L225 Difference]: With dead ends: 306 [2023-12-21 01:43:41,549 INFO L226 Difference]: Without dead ends: 217 [2023-12-21 01:43:41,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-21 01:43:41,551 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 206 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:43:41,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 350 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:43:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-21 01:43:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2023-12-21 01:43:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.3013698630136987) internal successors, (190), 146 states have internal predecessors, (190), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-21 01:43:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 262 transitions. [2023-12-21 01:43:41,576 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 262 transitions. Word has length 124 [2023-12-21 01:43:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:43:41,577 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 262 transitions. [2023-12-21 01:43:41,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:43:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 262 transitions. [2023-12-21 01:43:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 01:43:41,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:43:41,580 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:43:41,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:43:41,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:43:41,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:43:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash 442873600, now seen corresponding path program 1 times [2023-12-21 01:43:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:43:41,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639054171] [2023-12-21 01:43:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:43:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:43:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:43:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:43:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:43:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:43:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:43:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:43:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:43:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:43:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:43:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:43:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:43:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:43:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:43:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:43:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:43:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:43:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:43:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:43:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:43:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:43:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639054171] [2023-12-21 01:43:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639054171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:43:42,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:43:42,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:43:42,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658077673] [2023-12-21 01:43:42,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:43:42,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:43:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:43:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:43:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:43:42,997 INFO L87 Difference]: Start difference. First operand 185 states and 262 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:43:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:43:43,707 INFO L93 Difference]: Finished difference Result 595 states and 847 transitions. [2023-12-21 01:43:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 01:43:43,708 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2023-12-21 01:43:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:43:43,711 INFO L225 Difference]: With dead ends: 595 [2023-12-21 01:43:43,711 INFO L226 Difference]: Without dead ends: 411 [2023-12-21 01:43:43,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-12-21 01:43:43,714 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 331 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 01:43:43,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 927 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 01:43:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-21 01:43:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 337. [2023-12-21 01:43:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 272 states have (on average 1.3125) internal successors, (357), 274 states have internal predecessors, (357), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-21 01:43:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 477 transitions. [2023-12-21 01:43:43,772 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 477 transitions. Word has length 132 [2023-12-21 01:43:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:43:43,774 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 477 transitions. [2023-12-21 01:43:43,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-21 01:43:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 477 transitions. [2023-12-21 01:43:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:43:43,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:43:43,783 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:43:43,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:43:43,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:43:43,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:43:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1233213465, now seen corresponding path program 1 times [2023-12-21 01:43:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:43:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171686737] [2023-12-21 01:43:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:43:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:43:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:43:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:43:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:43:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:43:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:43:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:43:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:43:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:43:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:43:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:43:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:43:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:43:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:43:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:43:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:43:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:43:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:43:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:43:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:43:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:43:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:43:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171686737] [2023-12-21 01:43:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171686737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:43:46,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:43:46,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-21 01:43:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287643160] [2023-12-21 01:43:46,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:43:46,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 01:43:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:43:46,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 01:43:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2023-12-21 01:43:46,440 INFO L87 Difference]: Start difference. First operand 337 states and 477 transitions. Second operand has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 19 states have internal predecessors, (47), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2023-12-21 01:43:52,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:43:55,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:00,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:04,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:06,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:08,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:10,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:14,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:19,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:21,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:23,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:27,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:33,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:38,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:43,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 01:44:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:43,933 INFO L93 Difference]: Finished difference Result 837 states and 1167 transitions. [2023-12-21 01:44:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 01:44:43,934 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 19 states have internal predecessors, (47), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) Word has length 134 [2023-12-21 01:44:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:43,938 INFO L225 Difference]: With dead ends: 837 [2023-12-21 01:44:43,938 INFO L226 Difference]: Without dead ends: 501 [2023-12-21 01:44:43,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2023-12-21 01:44:43,941 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 559 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 116 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:43,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1359 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1628 Invalid, 6 Unknown, 0 Unchecked, 53.3s Time] [2023-12-21 01:44:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-12-21 01:44:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 436. [2023-12-21 01:44:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 346 states have (on average 1.2890173410404624) internal successors, (446), 350 states have internal predecessors, (446), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-21 01:44:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 610 transitions. [2023-12-21 01:44:43,990 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 610 transitions. Word has length 134 [2023-12-21 01:44:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:43,991 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 610 transitions. [2023-12-21 01:44:43,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 19 states have internal predecessors, (47), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2023-12-21 01:44:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 610 transitions. [2023-12-21 01:44:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:44:43,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:43,993 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:43,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:44:43,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:43,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1089429525, now seen corresponding path program 1 times [2023-12-21 01:44:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108817584] [2023-12-21 01:44:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:44:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:44:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:44:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:44:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:44:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:44:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:44:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:44:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:44:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:44:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:44:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:44:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:44:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:44:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:44:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:44:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:44:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:44:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:44:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:44:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:44:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108817584] [2023-12-21 01:44:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108817584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:44:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:44:44,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:44:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669632005] [2023-12-21 01:44:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:44:44,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:44:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:44:44,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:44:44,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:44:44,185 INFO L87 Difference]: Start difference. First operand 436 states and 610 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:44:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:44:44,262 INFO L93 Difference]: Finished difference Result 911 states and 1274 transitions. [2023-12-21 01:44:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:44:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2023-12-21 01:44:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:44:44,266 INFO L225 Difference]: With dead ends: 911 [2023-12-21 01:44:44,266 INFO L226 Difference]: Without dead ends: 496 [2023-12-21 01:44:44,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-21 01:44:44,268 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:44:44,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 454 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:44:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-12-21 01:44:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 451. [2023-12-21 01:44:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 361 states have (on average 1.2770083102493075) internal successors, (461), 365 states have internal predecessors, (461), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-12-21 01:44:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 625 transitions. [2023-12-21 01:44:44,328 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 625 transitions. Word has length 134 [2023-12-21 01:44:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:44:44,329 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 625 transitions. [2023-12-21 01:44:44,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-21 01:44:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 625 transitions. [2023-12-21 01:44:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 01:44:44,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:44:44,332 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:44:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:44:44,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:44:44,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:44:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1997485593, now seen corresponding path program 1 times [2023-12-21 01:44:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:44:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454126055] [2023-12-21 01:44:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:44:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:44:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:46:13,546 WARN L293 SmtUtils]: Spent 12.75s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 01:47:19,615 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 01:47:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 01:47:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 01:47:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 01:47:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 01:47:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 01:47:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 01:47:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 01:47:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 01:47:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-21 01:47:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-21 01:47:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-21 01:47:34,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:34,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454126055] [2023-12-21 01:47:34,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454126055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:34,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:34,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-21 01:47:34,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838521180] [2023-12-21 01:47:34,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:34,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 01:47:34,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:34,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 01:47:34,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=318, Unknown=12, NotChecked=0, Total=380 [2023-12-21 01:47:34,242 INFO L87 Difference]: Start difference. First operand 451 states and 625 transitions. Second operand has 20 states, 17 states have (on average 2.764705882352941) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Received shutdown request... [2023-12-21 01:57:59,895 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 01:58:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:58:00,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 96.4s TimeCoverageRelationStatistics Valid=50, Invalid=318, Unknown=12, NotChecked=0, Total=380 [2023-12-21 01:58:00,809 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:58:00,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:58:00,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:58:00,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:58:00,812 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (451states) and FLOYD_HOARE automaton (currently 2 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-8-5-2-2-2-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-7-4-2-2-2-1 context. [2023-12-21 01:58:00,816 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-21 01:58:00,819 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:58:00,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:58:00 BoogieIcfgContainer [2023-12-21 01:58:00,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:58:00,821 INFO L158 Benchmark]: Toolchain (without parser) took 861897.82ms. Allocated memory was 183.5MB in the beginning and 667.9MB in the end (delta: 484.4MB). Free memory was 139.0MB in the beginning and 349.4MB in the end (delta: -210.4MB). Peak memory consumption was 274.9MB. Max. memory is 8.0GB. [2023-12-21 01:58:00,821 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:58:00,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.74ms. Allocated memory is still 183.5MB. Free memory was 138.6MB in the beginning and 123.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 01:58:00,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.69ms. Allocated memory is still 183.5MB. Free memory was 123.3MB in the beginning and 119.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:58:00,824 INFO L158 Benchmark]: Boogie Preprocessor took 71.10ms. Allocated memory is still 183.5MB. Free memory was 119.1MB in the beginning and 114.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 01:58:00,825 INFO L158 Benchmark]: RCFGBuilder took 712.77ms. Allocated memory is still 183.5MB. Free memory was 114.2MB in the beginning and 82.4MB in the end (delta: 31.8MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-21 01:58:00,825 INFO L158 Benchmark]: TraceAbstraction took 860698.21ms. Allocated memory was 183.5MB in the beginning and 667.9MB in the end (delta: 484.4MB). Free memory was 82.0MB in the beginning and 349.4MB in the end (delta: -267.4MB). Peak memory consumption was 218.3MB. Max. memory is 8.0GB. [2023-12-21 01:58:00,827 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.14ms. Allocated memory is still 183.5MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 347.74ms. Allocated memory is still 183.5MB. Free memory was 138.6MB in the beginning and 123.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.69ms. Allocated memory is still 183.5MB. Free memory was 123.3MB in the beginning and 119.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.10ms. Allocated memory is still 183.5MB. Free memory was 119.1MB in the beginning and 114.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 712.77ms. Allocated memory is still 183.5MB. Free memory was 114.2MB in the beginning and 82.4MB in the end (delta: 31.8MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 860698.21ms. Allocated memory was 183.5MB in the beginning and 667.9MB in the end (delta: 484.4MB). Free memory was 82.0MB in the beginning and 349.4MB in the end (delta: -267.4MB). Peak memory consumption was 218.3MB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (451states) and FLOYD_HOARE automaton (currently 2 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-8-5-2-2-2-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-7-4-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 860.6s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 685.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1161 SdHoareTripleChecker+Valid, 53.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 3213 SdHoareTripleChecker+Invalid, 53.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2628 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2272 IncrementalHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 585 mSDtfsCounter, 2272 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 101.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=451occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 216 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 174.4s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 10812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 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: Timeout Completed graceful shutdown