./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:04:39,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:04:39,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:04:39,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:04:39,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:04:39,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:04:39,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:04:39,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:04:39,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:04:39,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:04:39,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:04:39,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:04:39,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:04:39,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:04:39,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:04:39,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:04:39,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:04:39,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:04:39,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:04:39,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:04:39,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:04:39,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:04:39,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:04:39,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:04:39,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:04:39,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:04:39,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:04:39,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:04:39,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:04:39,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:04:39,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:04:39,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:04:39,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:04:39,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:04:39,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:04:39,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:04:39,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:04:39,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:04:39,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:04:39,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:04:39,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:04:39,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:04:39,508 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1853b56352e1482e2d98ec9dc0018da4cac03b7278b9e8364e4147ad8890dd66 [2024-10-14 14:04:39,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:04:39,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:04:39,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:04:39,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:04:39,816 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:04:39,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2024-10-14 14:04:41,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:04:41,427 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:04:41,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i [2024-10-14 14:04:41,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c317a03/e13874ffefda4806ad8a7f20e03a03db/FLAG13e577d50 [2024-10-14 14:04:41,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c317a03/e13874ffefda4806ad8a7f20e03a03db [2024-10-14 14:04:41,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:04:41,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:04:41,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:04:41,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:04:41,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:04:41,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:04:41" (1/1) ... [2024-10-14 14:04:41,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b216b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:41, skipping insertion in model container [2024-10-14 14:04:41,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:04:41" (1/1) ... [2024-10-14 14:04:41,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:04:42,058 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2024-10-14 14:04:42,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:04:42,135 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:04:42,148 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-22.i[917,930] [2024-10-14 14:04:42,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:04:42,202 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:04:42,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42 WrapperNode [2024-10-14 14:04:42,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:04:42,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:04:42,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:04:42,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:04:42,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,279 INFO L138 Inliner]: procedures = 29, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-10-14 14:04:42,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:04:42,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:04:42,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:04:42,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:04:42,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,341 INFO L175 MemorySlicer]: Split 96 memory accesses to 2 slices as follows [2, 94]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 14 writes are split as follows [0, 14]. [2024-10-14 14:04:42,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:04:42,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:04:42,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:04:42,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:04:42,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (1/1) ... [2024-10-14 14:04:42,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:04:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:04:42,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:04:42,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:04:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:04:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:04:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:04:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:04:42,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:04:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:04:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:04:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:04:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:04:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:04:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:04:42,469 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:04:42,469 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:04:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:04:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:04:42,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:04:42,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:04:42,571 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:04:42,573 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:04:43,105 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-14 14:04:43,105 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:04:43,155 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:04:43,155 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:04:43,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:04:43 BoogieIcfgContainer [2024-10-14 14:04:43,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:04:43,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:04:43,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:04:43,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:04:43,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:04:41" (1/3) ... [2024-10-14 14:04:43,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6965cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:04:43, skipping insertion in model container [2024-10-14 14:04:43,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:42" (2/3) ... [2024-10-14 14:04:43,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6965cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:04:43, skipping insertion in model container [2024-10-14 14:04:43,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:04:43" (3/3) ... [2024-10-14 14:04:43,167 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-22.i [2024-10-14 14:04:43,181 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:04:43,181 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:04:43,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:04:43,248 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39f22eaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:04:43,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:04:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 14:04:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 14:04:43,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:43,268 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:43,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:43,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1574464759, now seen corresponding path program 1 times [2024-10-14 14:04:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111638116] [2024-10-14 14:04:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:43,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111638116] [2024-10-14 14:04:43,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111638116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:04:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372212287] [2024-10-14 14:04:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:43,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:04:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:04:43,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:04:43,778 INFO L87 Difference]: Start difference. First operand has 98 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 14:04:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:43,815 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-10-14 14:04:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:04:43,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2024-10-14 14:04:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:43,829 INFO L225 Difference]: With dead ends: 193 [2024-10-14 14:04:43,830 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 14:04:43,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:04:43,839 INFO L432 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:43,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:04:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 14:04:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-14 14:04:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 14:04:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-10-14 14:04:43,875 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 85 [2024-10-14 14:04:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:43,876 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-10-14 14:04:43,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 14:04:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-10-14 14:04:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 14:04:43,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:43,882 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:43,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:04:43,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:43,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash -544463861, now seen corresponding path program 1 times [2024-10-14 14:04:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:43,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295708749] [2024-10-14 14:04:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295708749] [2024-10-14 14:04:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295708749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:04:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526665961] [2024-10-14 14:04:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:44,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:04:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:44,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:04:44,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:04:44,182 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 14:04:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:44,237 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2024-10-14 14:04:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:04:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2024-10-14 14:04:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:44,242 INFO L225 Difference]: With dead ends: 193 [2024-10-14 14:04:44,242 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 14:04:44,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:04:44,244 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:44,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:04:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 14:04:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 14:04:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 14:04:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2024-10-14 14:04:44,255 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 85 [2024-10-14 14:04:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:44,256 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2024-10-14 14:04:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 14:04:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2024-10-14 14:04:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 14:04:44,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:44,259 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:44,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:04:44,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash -968110583, now seen corresponding path program 1 times [2024-10-14 14:04:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406833394] [2024-10-14 14:04:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406833394] [2024-10-14 14:04:45,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406833394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:45,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:04:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736250079] [2024-10-14 14:04:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:45,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:04:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:04:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:04:45,220 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:45,886 INFO L93 Difference]: Finished difference Result 323 states and 476 transitions. [2024-10-14 14:04:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:04:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 85 [2024-10-14 14:04:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:45,891 INFO L225 Difference]: With dead ends: 323 [2024-10-14 14:04:45,892 INFO L226 Difference]: Without dead ends: 226 [2024-10-14 14:04:45,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 14:04:45,893 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 206 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:45,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 325 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 14:04:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-14 14:04:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 145. [2024-10-14 14:04:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-10-14 14:04:45,928 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 85 [2024-10-14 14:04:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:45,930 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-10-14 14:04:45,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-10-14 14:04:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 14:04:45,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:45,932 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:45,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:04:45,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 621376463, now seen corresponding path program 1 times [2024-10-14 14:04:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171307984] [2024-10-14 14:04:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171307984] [2024-10-14 14:04:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171307984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:04:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003764741] [2024-10-14 14:04:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:46,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:04:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:04:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:04:46,073 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:46,096 INFO L93 Difference]: Finished difference Result 260 states and 380 transitions. [2024-10-14 14:04:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:04:46,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-10-14 14:04:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:46,098 INFO L225 Difference]: With dead ends: 260 [2024-10-14 14:04:46,098 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 14:04:46,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:04:46,100 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:46,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:04:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 14:04:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2024-10-14 14:04:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3951612903225807) internal successors, (173), 124 states have internal predecessors, (173), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2024-10-14 14:04:46,115 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 86 [2024-10-14 14:04:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:46,115 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2024-10-14 14:04:46,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2024-10-14 14:04:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 14:04:46,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:46,117 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:46,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:04:46,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:46,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1371091162, now seen corresponding path program 1 times [2024-10-14 14:04:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639999291] [2024-10-14 14:04:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:46,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:46,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639999291] [2024-10-14 14:04:46,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639999291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:46,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:46,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:04:46,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161631568] [2024-10-14 14:04:46,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:46,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:04:46,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:04:46,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:04:46,229 INFO L87 Difference]: Start difference. First operand 145 states and 209 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:46,293 INFO L93 Difference]: Finished difference Result 241 states and 348 transitions. [2024-10-14 14:04:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:04:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2024-10-14 14:04:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:46,295 INFO L225 Difference]: With dead ends: 241 [2024-10-14 14:04:46,295 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 14:04:46,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:04:46,296 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:46,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:04:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 14:04:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-14 14:04:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 206 transitions. [2024-10-14 14:04:46,309 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 206 transitions. Word has length 87 [2024-10-14 14:04:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:46,309 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 206 transitions. [2024-10-14 14:04:46,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 206 transitions. [2024-10-14 14:04:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 14:04:46,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:46,311 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:46,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:04:46,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1564238722, now seen corresponding path program 1 times [2024-10-14 14:04:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936670923] [2024-10-14 14:04:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:48,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936670923] [2024-10-14 14:04:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936670923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:48,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:48,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 14:04:48,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109210268] [2024-10-14 14:04:48,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:48,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 14:04:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 14:04:48,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:04:48,685 INFO L87 Difference]: Start difference. First operand 144 states and 206 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:49,532 INFO L93 Difference]: Finished difference Result 395 states and 562 transitions. [2024-10-14 14:04:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 14:04:49,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-10-14 14:04:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:49,535 INFO L225 Difference]: With dead ends: 395 [2024-10-14 14:04:49,535 INFO L226 Difference]: Without dead ends: 299 [2024-10-14 14:04:49,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-10-14 14:04:49,537 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 524 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:49,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 706 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 14:04:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-14 14:04:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 161. [2024-10-14 14:04:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 140 states have internal predecessors, (192), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 228 transitions. [2024-10-14 14:04:49,554 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 228 transitions. Word has length 90 [2024-10-14 14:04:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:49,554 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 228 transitions. [2024-10-14 14:04:49,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2024-10-14 14:04:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 14:04:49,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:49,556 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:49,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:04:49,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:49,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash 928145116, now seen corresponding path program 1 times [2024-10-14 14:04:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:49,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214210482] [2024-10-14 14:04:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:49,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214210482] [2024-10-14 14:04:49,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214210482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:49,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:49,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:04:49,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989405355] [2024-10-14 14:04:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:04:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:49,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:04:49,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:04:49,996 INFO L87 Difference]: Start difference. First operand 161 states and 228 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:50,253 INFO L93 Difference]: Finished difference Result 313 states and 446 transitions. [2024-10-14 14:04:50,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:04:50,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-14 14:04:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:50,256 INFO L225 Difference]: With dead ends: 313 [2024-10-14 14:04:50,256 INFO L226 Difference]: Without dead ends: 213 [2024-10-14 14:04:50,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:04:50,257 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:50,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 443 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:04:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-14 14:04:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 157. [2024-10-14 14:04:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 136 states have internal predecessors, (186), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2024-10-14 14:04:50,270 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 91 [2024-10-14 14:04:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:50,271 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2024-10-14 14:04:50,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2024-10-14 14:04:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 14:04:50,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:50,272 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:50,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:04:50,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:50,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -834491536, now seen corresponding path program 1 times [2024-10-14 14:04:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:50,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360528020] [2024-10-14 14:04:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360528020] [2024-10-14 14:04:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360528020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:04:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579516309] [2024-10-14 14:04:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:50,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:04:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:04:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:04:50,737 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:51,281 INFO L93 Difference]: Finished difference Result 333 states and 476 transitions. [2024-10-14 14:04:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:04:51,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-14 14:04:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:51,284 INFO L225 Difference]: With dead ends: 333 [2024-10-14 14:04:51,284 INFO L226 Difference]: Without dead ends: 237 [2024-10-14 14:04:51,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:04:51,288 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 181 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:51,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 375 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:04:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-14 14:04:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 166. [2024-10-14 14:04:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.3655172413793104) internal successors, (198), 145 states have internal predecessors, (198), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 234 transitions. [2024-10-14 14:04:51,305 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 234 transitions. Word has length 91 [2024-10-14 14:04:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:51,308 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 234 transitions. [2024-10-14 14:04:51,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 234 transitions. [2024-10-14 14:04:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 14:04:51,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:51,310 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:51,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:04:51,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:51,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -968505042, now seen corresponding path program 1 times [2024-10-14 14:04:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:51,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78494694] [2024-10-14 14:04:51,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78494694] [2024-10-14 14:04:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78494694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:52,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 14:04:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961642707] [2024-10-14 14:04:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:04:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:04:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:04:52,627 INFO L87 Difference]: Start difference. First operand 166 states and 234 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 14:04:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:53,487 INFO L93 Difference]: Finished difference Result 316 states and 449 transitions. [2024-10-14 14:04:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:04:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 91 [2024-10-14 14:04:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:53,489 INFO L225 Difference]: With dead ends: 316 [2024-10-14 14:04:53,489 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 14:04:53,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-10-14 14:04:53,490 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 170 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:53,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 535 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 14:04:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 14:04:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2024-10-14 14:04:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 151 states have internal predecessors, (206), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2024-10-14 14:04:53,503 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 91 [2024-10-14 14:04:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:53,504 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2024-10-14 14:04:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 14:04:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2024-10-14 14:04:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 14:04:53,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:53,505 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:04:53,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1948985949, now seen corresponding path program 1 times [2024-10-14 14:04:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368331021] [2024-10-14 14:04:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368331021] [2024-10-14 14:04:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368331021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:54,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 14:04:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587352242] [2024-10-14 14:04:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:54,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 14:04:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 14:04:54,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:04:54,881 INFO L87 Difference]: Start difference. First operand 172 states and 242 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:55,481 INFO L93 Difference]: Finished difference Result 354 states and 501 transitions. [2024-10-14 14:04:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:04:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-10-14 14:04:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:55,483 INFO L225 Difference]: With dead ends: 354 [2024-10-14 14:04:55,483 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 14:04:55,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-10-14 14:04:55,484 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 334 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:55,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 676 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:04:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 14:04:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 180. [2024-10-14 14:04:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 159 states have internal predecessors, (217), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 253 transitions. [2024-10-14 14:04:55,497 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 253 transitions. Word has length 92 [2024-10-14 14:04:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:55,497 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 253 transitions. [2024-10-14 14:04:55,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 14:04:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 253 transitions. [2024-10-14 14:04:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 14:04:55,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:55,499 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:55,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 14:04:55,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:55,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1366001160, now seen corresponding path program 1 times [2024-10-14 14:04:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046501294] [2024-10-14 14:04:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 14:04:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046501294] [2024-10-14 14:04:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046501294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:04:56,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:04:56,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 14:04:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485626919] [2024-10-14 14:04:56,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:04:56,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:04:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:04:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:04:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:04:56,510 INFO L87 Difference]: Start difference. First operand 180 states and 253 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 14:04:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:04:57,111 INFO L93 Difference]: Finished difference Result 372 states and 523 transitions. [2024-10-14 14:04:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:04:57,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-10-14 14:04:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:04:57,113 INFO L225 Difference]: With dead ends: 372 [2024-10-14 14:04:57,114 INFO L226 Difference]: Without dead ends: 268 [2024-10-14 14:04:57,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:04:57,116 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 355 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:04:57,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 667 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:04:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-14 14:04:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 176. [2024-10-14 14:04:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3548387096774193) internal successors, (210), 155 states have internal predecessors, (210), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:04:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 246 transitions. [2024-10-14 14:04:57,131 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 246 transitions. Word has length 92 [2024-10-14 14:04:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:04:57,132 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 246 transitions. [2024-10-14 14:04:57,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 14:04:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 246 transitions. [2024-10-14 14:04:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 14:04:57,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:04:57,133 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:04:57,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:04:57,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:04:57,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:04:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -638041110, now seen corresponding path program 1 times [2024-10-14 14:04:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:04:57,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439276687] [2024-10-14 14:04:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:04:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:04:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:04:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:04:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:04:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 14:04:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:04:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:04:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:04:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 14:04:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-14 14:04:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:04:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439276687] [2024-10-14 14:04:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439276687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:04:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153985058] [2024-10-14 14:04:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:04:57,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:04:57,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:04:57,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:04:57,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 14:04:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:04:57,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-14 14:04:57,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:04:58,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-14 14:04:59,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 14:04:59,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:04:59,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2024-10-14 14:04:59,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:04:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:04:59,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:04:59,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-14 14:04:59,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:04:59,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:04:59,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:04:59,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-14 14:05:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-14 14:05:00,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:05:34,965 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-14 14:05:41,552 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-14 14:05:58,520 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-14 14:05:59,244 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-14 14:05:59,452 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-14 14:05:59,524 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-14 14:06:00,355 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.