./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-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-83.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 a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:03:24,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:03:24,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:03:24,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:03:24,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:03:24,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:03:24,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:03:24,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:03:24,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:03:24,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:03:24,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:03:24,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:03:24,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:03:24,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:03:24,473 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:03:24,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:03:24,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:03:24,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:03:24,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:03:24,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:03:24,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:03:24,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:03:24,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:03:24,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:03:24,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:03:24,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:03:24,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:03:24,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:03:24,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:03:24,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:03:24,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:03:24,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:03:24,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:03:24,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:03:24,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:03:24,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:03:24,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:03:24,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:03:24,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:03:24,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:03:24,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:03:24,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:03:24,481 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 -> a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a [2024-10-24 12:03:24,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:03:24,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:03:24,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:03:24,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:03:24,775 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:03:24,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-24 12:03:26,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:03:26,482 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:03:26,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-24 12:03:26,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a3d2cb4/3460a441a23549e2a1e34c0cde19967f/FLAG470a98873 [2024-10-24 12:03:26,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a3d2cb4/3460a441a23549e2a1e34c0cde19967f [2024-10-24 12:03:26,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:03:26,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:03:26,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:03:26,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:03:26,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:03:26,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:03:26" (1/1) ... [2024-10-24 12:03:26,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fba0097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:26, skipping insertion in model container [2024-10-24 12:03:26,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:03:26" (1/1) ... [2024-10-24 12:03:26,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:03:27,115 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-83.i[917,930] [2024-10-24 12:03:27,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:03:27,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:03:27,236 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-83.i[917,930] [2024-10-24 12:03:27,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:03:27,308 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:03:27,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27 WrapperNode [2024-10-24 12:03:27,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:03:27,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:03:27,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:03:27,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:03:27,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,365 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-10-24 12:03:27,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:03:27,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:03:27,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:03:27,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:03:27,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,432 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-24 12:03:27,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:03:27,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:03:27,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:03:27,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:03:27,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (1/1) ... [2024-10-24 12:03:27,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:03:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:03:27,528 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-24 12:03:27,536 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-24 12:03:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:03:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:03:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:03:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:03:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:03:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:03:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:03:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:03:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:03:27,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:03:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:03:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:03:27,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:03:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:03:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:03:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:03:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:03:27,705 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:03:27,707 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:03:28,269 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-24 12:03:28,272 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:03:28,319 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:03:28,319 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:03:28,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:03:28 BoogieIcfgContainer [2024-10-24 12:03:28,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:03:28,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:03:28,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:03:28,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:03:28,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:03:26" (1/3) ... [2024-10-24 12:03:28,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5bb688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:03:28, skipping insertion in model container [2024-10-24 12:03:28,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:03:27" (2/3) ... [2024-10-24 12:03:28,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5bb688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:03:28, skipping insertion in model container [2024-10-24 12:03:28,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:03:28" (3/3) ... [2024-10-24 12:03:28,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-24 12:03:28,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:03:28,350 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:03:28,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:03:28,426 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;@782ef03d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:03:28,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:03:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 12:03:28,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:28,447 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:28,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:28,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -859057060, now seen corresponding path program 1 times [2024-10-24 12:03:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:28,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669812319] [2024-10-24 12:03:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:28,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669812319] [2024-10-24 12:03:28,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669812319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:28,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:28,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:03:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823986680] [2024-10-24 12:03:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:28,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:03:28,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:03:28,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:03:28,920 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 12:03:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:28,965 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-10-24 12:03:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:03:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-24 12:03:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:28,977 INFO L225 Difference]: With dead ends: 207 [2024-10-24 12:03:28,977 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 12:03:28,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-24 12:03:28,984 INFO L432 NwaCegarLoop]: 144 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, 144 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-24 12:03:28,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:03:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 12:03:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 12:03:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-10-24 12:03:29,025 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 101 [2024-10-24 12:03:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:29,026 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-10-24 12:03:29,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 12:03:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-10-24 12:03:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 12:03:29,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:29,029 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:29,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:03:29,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:29,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1754611118, now seen corresponding path program 1 times [2024-10-24 12:03:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362508196] [2024-10-24 12:03:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:29,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362508196] [2024-10-24 12:03:29,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362508196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:29,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:03:29,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123276025] [2024-10-24 12:03:29,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:29,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:03:29,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:29,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:03:29,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:03:29,345 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 12:03:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:29,410 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2024-10-24 12:03:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:03:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-24 12:03:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:29,412 INFO L225 Difference]: With dead ends: 207 [2024-10-24 12:03:29,412 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 12:03:29,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 12:03:29,415 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 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-24 12:03:29,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:03:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 12:03:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-24 12:03:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-10-24 12:03:29,427 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 101 [2024-10-24 12:03:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:29,428 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-10-24 12:03:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 12:03:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-10-24 12:03:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 12:03:29,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:29,432 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:29,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:03:29,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -184550928, now seen corresponding path program 1 times [2024-10-24 12:03:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631806650] [2024-10-24 12:03:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:29,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:29,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631806650] [2024-10-24 12:03:29,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631806650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:29,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:03:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523117478] [2024-10-24 12:03:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:29,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:03:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:03:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:03:29,695 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:29,755 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2024-10-24 12:03:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:03:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 12:03:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:29,759 INFO L225 Difference]: With dead ends: 212 [2024-10-24 12:03:29,759 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 12:03:29,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 12:03:29,763 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:29,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:03:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 12:03:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-24 12:03:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-24 12:03:29,779 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 101 [2024-10-24 12:03:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:29,780 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-24 12:03:29,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-24 12:03:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 12:03:29,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:29,782 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:29,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:03:29,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:29,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash -993897554, now seen corresponding path program 1 times [2024-10-24 12:03:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225385709] [2024-10-24 12:03:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225385709] [2024-10-24 12:03:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225385709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:03:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942812110] [2024-10-24 12:03:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:30,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:03:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:03:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:03:30,016 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:30,058 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2024-10-24 12:03:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:03:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 12:03:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:30,061 INFO L225 Difference]: With dead ends: 216 [2024-10-24 12:03:30,061 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 12:03:30,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 12:03:30,063 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:30,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:03:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 12:03:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-24 12:03:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-24 12:03:30,079 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 101 [2024-10-24 12:03:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:30,083 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-24 12:03:30,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-24 12:03:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 12:03:30,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:30,085 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:30,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:03:30,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:30,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash -936639252, now seen corresponding path program 1 times [2024-10-24 12:03:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401435077] [2024-10-24 12:03:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401435077] [2024-10-24 12:03:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401435077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:30,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:30,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:03:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021815116] [2024-10-24 12:03:30,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:30,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:03:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:30,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:03:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:03:30,253 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:30,288 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-10-24 12:03:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:03:30,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 12:03:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:30,293 INFO L225 Difference]: With dead ends: 220 [2024-10-24 12:03:30,293 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 12:03:30,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 12:03:30,294 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:30,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:03:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 12:03:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-24 12:03:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-24 12:03:30,306 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 101 [2024-10-24 12:03:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:30,307 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-24 12:03:30,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-24 12:03:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 12:03:30,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:30,311 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:03:30,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:30,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash -936579670, now seen corresponding path program 1 times [2024-10-24 12:03:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706151351] [2024-10-24 12:03:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:30,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706151351] [2024-10-24 12:03:31,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706151351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:31,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:03:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040893036] [2024-10-24 12:03:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:31,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 12:03:31,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 12:03:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:03:31,124 INFO L87 Difference]: Start difference. First operand 111 states and 156 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:31,369 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2024-10-24 12:03:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:03:31,372 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 12:03:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:31,373 INFO L225 Difference]: With dead ends: 221 [2024-10-24 12:03:31,373 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 12:03:31,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:03:31,375 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 163 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:31,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 279 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:03:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 12:03:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 12:03:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-24 12:03:31,390 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 101 [2024-10-24 12:03:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:31,390 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-24 12:03:31,390 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-24 12:03:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 12:03:31,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:31,392 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:31,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:03:31,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:31,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2061795194, now seen corresponding path program 1 times [2024-10-24 12:03:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091258515] [2024-10-24 12:03:31,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:31,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091258515] [2024-10-24 12:03:31,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091258515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:31,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:31,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:03:31,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996557107] [2024-10-24 12:03:31,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:31,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:03:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:03:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:03:31,623 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:31,769 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2024-10-24 12:03:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:03:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-24 12:03:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:31,771 INFO L225 Difference]: With dead ends: 223 [2024-10-24 12:03:31,771 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 12:03:31,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:03:31,774 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:31,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 454 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:03:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 12:03:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 12:03:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-24 12:03:31,788 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 102 [2024-10-24 12:03:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:31,789 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-24 12:03:31,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-24 12:03:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 12:03:31,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:31,791 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:31,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:03:31,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2060604880, now seen corresponding path program 1 times [2024-10-24 12:03:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379215586] [2024-10-24 12:03:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379215586] [2024-10-24 12:03:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379215586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:32,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:32,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:03:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011087706] [2024-10-24 12:03:32,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:32,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:03:32,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:32,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:03:32,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:03:32,971 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:33,393 INFO L93 Difference]: Finished difference Result 292 states and 405 transitions. [2024-10-24 12:03:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:03:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 12:03:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:33,395 INFO L225 Difference]: With dead ends: 292 [2024-10-24 12:03:33,395 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 12:03:33,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:03:33,396 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 257 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:33,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 561 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:03:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 12:03:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2024-10-24 12:03:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-10-24 12:03:33,418 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 103 [2024-10-24 12:03:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-10-24 12:03:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-10-24 12:03:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 12:03:33,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:33,422 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:03:33,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:33,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash 780741202, now seen corresponding path program 1 times [2024-10-24 12:03:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:33,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425793807] [2024-10-24 12:03:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 12:03:33,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860391375] [2024-10-24 12:03:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:33,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:03:33,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:03:33,579 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-24 12:03:33,581 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-24 12:03:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:33,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 12:03:33,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:03:34,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:03:34,514 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 23 treesize of output 11 [2024-10-24 12:03:34,543 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 15 treesize of output 7 [2024-10-24 12:03:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:34,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:03:34,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:34,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425793807] [2024-10-24 12:03:34,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 12:03:34,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860391375] [2024-10-24 12:03:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860391375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:34,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:34,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 12:03:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108802094] [2024-10-24 12:03:34,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:34,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:03:34,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:03:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:03:34,571 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:34,839 INFO L93 Difference]: Finished difference Result 334 states and 467 transitions. [2024-10-24 12:03:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:03:34,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 12:03:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:34,841 INFO L225 Difference]: With dead ends: 334 [2024-10-24 12:03:34,841 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 12:03:34,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:03:34,842 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 294 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:34,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 350 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:03:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 12:03:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 150. [2024-10-24 12:03:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 137 states have (on average 1.3795620437956204) internal successors, (189), 137 states have internal predecessors, (189), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 12:03:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 211 transitions. [2024-10-24 12:03:34,857 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 211 transitions. Word has length 103 [2024-10-24 12:03:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 211 transitions. [2024-10-24 12:03:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 211 transitions. [2024-10-24 12:03:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 12:03:34,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:34,860 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:34,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:03:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:03:35,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:35,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -240327152, now seen corresponding path program 1 times [2024-10-24 12:03:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062517217] [2024-10-24 12:03:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 12:03:35,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154588850] [2024-10-24 12:03:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:35,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:03:35,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:03:35,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:03:35,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:03:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:35,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 12:03:35,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:03:35,583 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 7 treesize of output 3 [2024-10-24 12:03:36,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:03:36,324 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-10-24 12:03:36,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2024-10-24 12:03:36,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:03:36,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 12:03:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:36,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:03:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062517217] [2024-10-24 12:03:36,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 12:03:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154588850] [2024-10-24 12:03:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154588850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:03:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679323087] [2024-10-24 12:03:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:36,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:03:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:03:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:03:36,407 INFO L87 Difference]: Start difference. First operand 150 states and 211 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:40,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:03:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:41,168 INFO L93 Difference]: Finished difference Result 470 states and 664 transitions. [2024-10-24 12:03:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:03:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 12:03:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:41,171 INFO L225 Difference]: With dead ends: 470 [2024-10-24 12:03:41,171 INFO L226 Difference]: Without dead ends: 321 [2024-10-24 12:03:41,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:03:41,172 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 179 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:41,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 622 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-24 12:03:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-24 12:03:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 198. [2024-10-24 12:03:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 states have internal predecessors, (234), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 12:03:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 278 transitions. [2024-10-24 12:03:41,198 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 278 transitions. Word has length 103 [2024-10-24 12:03:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:41,198 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 278 transitions. [2024-10-24 12:03:41,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 278 transitions. [2024-10-24 12:03:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 12:03:41,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:41,200 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:41,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:03:41,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 12:03:41,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:41,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1171126897, now seen corresponding path program 1 times [2024-10-24 12:03:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80784342] [2024-10-24 12:03:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80784342] [2024-10-24 12:03:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80784342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:42,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:03:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132844409] [2024-10-24 12:03:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:42,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:03:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:42,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:03:42,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:03:42,994 INFO L87 Difference]: Start difference. First operand 198 states and 278 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 12:03:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:43,628 INFO L93 Difference]: Finished difference Result 351 states and 491 transitions. [2024-10-24 12:03:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:03:43,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-10-24 12:03:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:43,630 INFO L225 Difference]: With dead ends: 351 [2024-10-24 12:03:43,630 INFO L226 Difference]: Without dead ends: 202 [2024-10-24 12:03:43,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:03:43,631 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 219 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:43,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 287 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:03:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-24 12:03:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-24 12:03:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 176 states have internal predecessors, (235), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 12:03:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2024-10-24 12:03:43,658 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 103 [2024-10-24 12:03:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:43,658 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2024-10-24 12:03:43,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 12:03:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2024-10-24 12:03:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 12:03:43,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:43,662 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:43,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:03:43,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:43,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash -749800242, now seen corresponding path program 1 times [2024-10-24 12:03:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133429353] [2024-10-24 12:03:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:03:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:03:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:03:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:03:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:03:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:03:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:03:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 12:03:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:03:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:03:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:03:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:03:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 12:03:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:03:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133429353] [2024-10-24 12:03:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133429353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:03:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:03:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:03:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28512728] [2024-10-24 12:03:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:03:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:03:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:03:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:03:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:03:45,004 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:03:45,944 INFO L93 Difference]: Finished difference Result 455 states and 628 transitions. [2024-10-24 12:03:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:03:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 12:03:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:03:45,947 INFO L225 Difference]: With dead ends: 455 [2024-10-24 12:03:45,947 INFO L226 Difference]: Without dead ends: 302 [2024-10-24 12:03:45,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:03:45,949 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 324 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:03:45,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 614 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 12:03:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-24 12:03:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 229. [2024-10-24 12:03:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 12:03:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 318 transitions. [2024-10-24 12:03:45,981 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 318 transitions. Word has length 103 [2024-10-24 12:03:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:03:45,981 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 318 transitions. [2024-10-24 12:03:45,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 12:03:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 318 transitions. [2024-10-24 12:03:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 12:03:45,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:03:45,983 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:03:45,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:03:45,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:03:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:03:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1841675826, now seen corresponding path program 1 times [2024-10-24 12:03:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:03:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85546293] [2024-10-24 12:03:45,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:03:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:03:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat