./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/verifythis/prefixsum_iter.c -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.graphml --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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:56:43,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:56:43,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:56:43,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:56:43,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:56:43,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:56:43,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:56:43,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:56:43,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:56:43,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:56:43,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:56:43,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:56:43,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:56:43,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:56:43,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:56:43,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:56:43,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:56:43,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:56:43,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:56:43,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:56:43,442 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:56:43,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:56:43,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:56:43,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:56:43,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:56:43,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:56:43,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:56:43,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:56:43,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:56:43,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:56:43,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:56:43,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:56:43,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:56:43,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:56:43,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:56:43,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:56:43,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:56:43,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:56:43,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:56:43,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:56:43,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:56:43,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:56:43,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:56:43,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:56:43,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:56:43,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:56:43,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:56:43,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:56:43,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:56:43,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:56:43,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:56:43,487 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:56:43,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:56:43,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:56:43,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:56:43,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:56:43,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:56:43,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:56:43,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:56:43,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:56:43,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:56:43,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:56:43,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:56:43,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:56:43,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:56:43,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:56:43,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:56:43,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:56:43,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:56:43,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:56:43,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:56:43,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:56:43,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:56:43,492 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:56:43,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:56:43,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:56:43,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2022-07-13 15:56:43,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:56:43,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:56:43,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:56:43,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:56:43,718 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:56:43,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-07-13 15:56:43,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064a6f957/bd4f0d02a51d4c53b74e817d13d91661/FLAGa7f0c19d9 [2022-07-13 15:56:44,109 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:56:44,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-07-13 15:56:44,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064a6f957/bd4f0d02a51d4c53b74e817d13d91661/FLAGa7f0c19d9 [2022-07-13 15:56:44,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/064a6f957/bd4f0d02a51d4c53b74e817d13d91661 [2022-07-13 15:56:44,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:56:44,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:56:44,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:56:44,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:56:44,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:56:44,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcbc6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44, skipping insertion in model container [2022-07-13 15:56:44,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:56:44,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:56:44,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-07-13 15:56:44,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:56:44,292 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:56:44,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2022-07-13 15:56:44,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:56:44,318 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:56:44,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44 WrapperNode [2022-07-13 15:56:44,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:56:44,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:56:44,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:56:44,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:56:44,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,375 INFO L137 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2022-07-13 15:56:44,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:56:44,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:56:44,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:56:44,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:56:44,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:56:44,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:56:44,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:56:44,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:56:44,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:56:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:56:44,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:56:44,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:56:44,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:56:44,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 15:56:44,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 15:56:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:56:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:56:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:56:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:56:44,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:56:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:56:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-13 15:56:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-13 15:56:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:56:44,593 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:56:44,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:56:44,821 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:56:44,827 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:56:44,828 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-13 15:56:44,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:56:44 BoogieIcfgContainer [2022-07-13 15:56:44,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:56:44,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:56:44,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:56:44,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:56:44,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:56:44" (1/3) ... [2022-07-13 15:56:44,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16735e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:56:44, skipping insertion in model container [2022-07-13 15:56:44,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (2/3) ... [2022-07-13 15:56:44,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16735e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:56:44, skipping insertion in model container [2022-07-13 15:56:44,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:56:44" (3/3) ... [2022-07-13 15:56:44,847 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-07-13 15:56:44,857 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:56:44,858 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:56:44,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:56:44,920 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b0fc5aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e9a3790 [2022-07-13 15:56:44,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:56:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:56:44,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:44,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:44,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash -750888739, now seen corresponding path program 1 times [2022-07-13 15:56:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:44,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431417354] [2022-07-13 15:56:44,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:56:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:56:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:56:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:56:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431417354] [2022-07-13 15:56:45,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431417354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:45,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:45,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:56:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90907342] [2022-07-13 15:56:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:45,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:56:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:45,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:56:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:56:45,165 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 15:56:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:45,234 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2022-07-13 15:56:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:56:45,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-13 15:56:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:45,240 INFO L225 Difference]: With dead ends: 81 [2022-07-13 15:56:45,240 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 15:56:45,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:56:45,252 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:45,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:56:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 15:56:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-13 15:56:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-13 15:56:45,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-07-13 15:56:45,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:45,285 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-13 15:56:45,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 15:56:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-13 15:56:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:56:45,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:45,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:45,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:56:45,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash 221792227, now seen corresponding path program 1 times [2022-07-13 15:56:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:45,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131567408] [2022-07-13 15:56:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:56:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:56:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:56:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:56:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:45,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131567408] [2022-07-13 15:56:45,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131567408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:45,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:45,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:56:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655025023] [2022-07-13 15:56:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:45,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:56:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:56:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:56:45,452 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:56:47,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:56:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:47,836 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2022-07-13 15:56:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:56:47,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-13 15:56:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:47,838 INFO L225 Difference]: With dead ends: 97 [2022-07-13 15:56:47,838 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 15:56:47,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:56:47,840 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 72 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:47,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 259 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 15:56:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 15:56:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2022-07-13 15:56:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-13 15:56:47,853 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2022-07-13 15:56:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:47,854 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-13 15:56:47,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:56:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-13 15:56:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:56:47,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:47,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:47,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:56:47,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash 747513669, now seen corresponding path program 1 times [2022-07-13 15:56:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:47,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382416133] [2022-07-13 15:56:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:48,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:56:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:48,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:56:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:56:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:56:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:48,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382416133] [2022-07-13 15:56:48,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382416133] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:56:48,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373864051] [2022-07-13 15:56:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:56:48,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:56:48,171 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) [2022-07-13 15:56:48,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:56:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:48,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 15:56:48,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:56:48,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:56:48,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:56:48,429 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:56:48,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:56:48,446 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_45 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_45))) is different from true [2022-07-13 15:56:48,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-07-13 15:56:48,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-07-13 15:56:48,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-13 15:56:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-07-13 15:56:48,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:11,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_check_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~a#1.offset_4| Int) (|v_ULTIMATE.start_downsweep_~n#1_5| Int) (|ULTIMATE.start_check_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) |v_ULTIMATE.start_downsweep_~a#1.offset_4| (* |v_ULTIMATE.start_downsweep_~n#1_5| 4)) 0) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))) 0)) is different from false [2022-07-13 15:57:11,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_check_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~a#1.offset_4| Int) (|v_ULTIMATE.start_downsweep_~n#1_5| Int) (v_ArrVal_46 (Array Int Int)) (|ULTIMATE.start_check_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) |v_ULTIMATE.start_downsweep_~a#1.offset_4| (* |v_ULTIMATE.start_downsweep_~n#1_5| 4)) 0) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))) 0)) is different from false [2022-07-13 15:57:11,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_check_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~a#1.offset_4| Int) (|v_ULTIMATE.start_downsweep_~n#1_5| Int) (v_ArrVal_46 (Array Int Int)) (|ULTIMATE.start_check_~i~0#1| Int)) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) |v_ULTIMATE.start_downsweep_~a#1.offset_4| (* |v_ULTIMATE.start_downsweep_~n#1_5| 4)) 0) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))))) is different from false [2022-07-13 15:57:11,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373864051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:11,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:11,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 17 [2022-07-13 15:57:11,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806882992] [2022-07-13 15:57:11,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:11,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 15:57:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:11,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 15:57:11,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=251, Unknown=15, NotChecked=140, Total=462 [2022-07-13 15:57:11,496 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 15:57:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:21,768 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-13 15:57:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:57:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-07-13 15:57:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:21,769 INFO L225 Difference]: With dead ends: 49 [2022-07-13 15:57:21,769 INFO L226 Difference]: Without dead ends: 47 [2022-07-13 15:57:21,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=129, Invalid=569, Unknown=20, NotChecked=212, Total=930 [2022-07-13 15:57:21,771 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:21,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 232 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2022-07-13 15:57:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-13 15:57:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-07-13 15:57:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:57:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-13 15:57:21,776 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 39 [2022-07-13 15:57:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:21,776 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-13 15:57:21,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 15:57:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-13 15:57:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 15:57:21,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:21,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:21,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:21,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:21,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1715230204, now seen corresponding path program 1 times [2022-07-13 15:57:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:21,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737015814] [2022-07-13 15:57:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:21,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:57:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:57:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:57:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:57:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:57:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:22,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737015814] [2022-07-13 15:57:22,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737015814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814290375] [2022-07-13 15:57:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:22,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:22,102 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) [2022-07-13 15:57:22,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:57:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:57:22,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:57:22,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 15:57:22,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814290375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:22,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:57:22,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-07-13 15:57:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254390651] [2022-07-13 15:57:22,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:22,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 15:57:22,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 15:57:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:57:22,333 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:22,590 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-07-13 15:57:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 15:57:22,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-13 15:57:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:22,592 INFO L225 Difference]: With dead ends: 116 [2022-07-13 15:57:22,592 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 15:57:22,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-07-13 15:57:22,593 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 115 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:22,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 179 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 15:57:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 46. [2022-07-13 15:57:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:57:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-13 15:57:22,598 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2022-07-13 15:57:22,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:22,598 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-13 15:57:22,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-13 15:57:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 15:57:22,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:22,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:22,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:22,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 15:57:22,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1080974370, now seen corresponding path program 2 times [2022-07-13 15:57:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:22,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902265010] [2022-07-13 15:57:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:57:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:57:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:57:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:57:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 15:57:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:22,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902265010] [2022-07-13 15:57:22,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902265010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452109181] [2022-07-13 15:57:22,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:57:22,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:22,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:22,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:22,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:57:22,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:57:22,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:57:22,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 15:57:22,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:57:23,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:57:23,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452109181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:23,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:57:23,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-07-13 15:57:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195455694] [2022-07-13 15:57:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:57:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:57:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:57:23,066 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:23,163 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-07-13 15:57:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:57:23,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-07-13 15:57:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:23,164 INFO L225 Difference]: With dead ends: 66 [2022-07-13 15:57:23,164 INFO L226 Difference]: Without dead ends: 49 [2022-07-13 15:57:23,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:57:23,165 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:23,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 129 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:57:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-13 15:57:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-07-13 15:57:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:57:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-07-13 15:57:23,169 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 45 [2022-07-13 15:57:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:23,170 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-07-13 15:57:23,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-07-13 15:57:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 15:57:23,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:23,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:23,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:23,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:23,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1924122647, now seen corresponding path program 1 times [2022-07-13 15:57:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:23,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805683529] [2022-07-13 15:57:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:57:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:57:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:57:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:57:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 15:57:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:23,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805683529] [2022-07-13 15:57:23,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805683529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:23,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:57:23,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:57:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448663151] [2022-07-13 15:57:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:23,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:57:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:57:23,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:57:23,436 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:23,463 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-07-13 15:57:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:57:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-07-13 15:57:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:23,466 INFO L225 Difference]: With dead ends: 65 [2022-07-13 15:57:23,466 INFO L226 Difference]: Without dead ends: 48 [2022-07-13 15:57:23,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:57:23,467 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:23,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:57:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-13 15:57:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-13 15:57:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:57:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-13 15:57:23,471 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 48 [2022-07-13 15:57:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:23,472 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-13 15:57:23,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-13 15:57:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 15:57:23,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:23,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:23,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:57:23,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1397539149, now seen corresponding path program 1 times [2022-07-13 15:57:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:23,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365568058] [2022-07-13 15:57:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:57:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:57:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:57:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:57:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:57:23,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:23,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365568058] [2022-07-13 15:57:23,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365568058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:23,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023908059] [2022-07-13 15:57:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:23,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:23,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:23,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:23,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:57:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:23,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 15:57:23,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 15:57:23,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:57:23,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023908059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:57:23,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 15:57:23,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2022-07-13 15:57:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231783058] [2022-07-13 15:57:23,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:57:23,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:57:23,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:57:23,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:57:23,700 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:23,746 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-07-13 15:57:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:57:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-07-13 15:57:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:23,748 INFO L225 Difference]: With dead ends: 61 [2022-07-13 15:57:23,748 INFO L226 Difference]: Without dead ends: 52 [2022-07-13 15:57:23,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:57:23,749 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:23,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 129 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:57:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-13 15:57:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-07-13 15:57:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:57:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-13 15:57:23,753 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2022-07-13 15:57:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:23,753 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-13 15:57:23,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-13 15:57:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 15:57:23,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:23,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:23,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:23,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:23,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1418623757, now seen corresponding path program 1 times [2022-07-13 15:57:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620659407] [2022-07-13 15:57:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:57:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:57:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:57:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:57:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:57:24,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:24,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620659407] [2022-07-13 15:57:24,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620659407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:24,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215518193] [2022-07-13 15:57:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:24,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:24,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:24,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:57:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:24,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:57:24,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:57:24,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:57:24,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215518193] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:57:24,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:57:24,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2022-07-13 15:57:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495992819] [2022-07-13 15:57:24,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:24,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:57:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:57:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:57:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:57:24,344 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:26,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:57:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:26,862 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2022-07-13 15:57:26,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 15:57:26,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-07-13 15:57:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:26,864 INFO L225 Difference]: With dead ends: 99 [2022-07-13 15:57:26,864 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 15:57:26,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2022-07-13 15:57:26,865 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 101 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:26,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 321 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 346 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 15:57:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 15:57:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 51. [2022-07-13 15:57:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:57:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-13 15:57:26,870 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 52 [2022-07-13 15:57:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:26,870 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-13 15:57:26,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:57:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-13 15:57:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 15:57:26,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:26,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:26,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:27,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:27,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:27,072 INFO L85 PathProgramCache]: Analyzing trace with hash -282483074, now seen corresponding path program 1 times [2022-07-13 15:57:27,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:57:27,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521612811] [2022-07-13 15:57:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:57:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:57:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:27,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:57:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:27,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:57:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:57:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 15:57:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:57:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521612811] [2022-07-13 15:57:27,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521612811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211974942] [2022-07-13 15:57:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:27,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:57:27,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:57:27,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:57:27,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 15:57:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:27,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-13 15:57:27,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:27,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:57:27,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:57:27,410 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:57:27,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:57:27,438 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_212 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_212) |c_#memory_int|)) is different from true [2022-07-13 15:57:27,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-07-13 15:57:27,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-13 15:57:27,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-13 15:57:27,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 33 treesize of output 29 [2022-07-13 15:57:27,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:57:27,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2022-07-13 15:57:27,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 50 treesize of output 44 [2022-07-13 15:57:27,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2022-07-13 15:57:29,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 82 treesize of output 74 [2022-07-13 15:57:35,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 207 treesize of output 193 [2022-07-13 15:57:35,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 173 treesize of output 167 [2022-07-13 15:57:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-07-13 15:57:36,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:16,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~n~0#1| Int)) (or (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_220 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_215 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_215)))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse5 .cse6)))) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_220)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (select .cse3 .cse4))) (or (let ((.cse0 (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1))) (= .cse0 (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 .cse4 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|)))) (not (= .cse1 0))))))) (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|) (not (< |c_ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~n~0#1|)))) is different from false [2022-07-13 15:58:18,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_220 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_215 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| 4 (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_215)))) (let ((.cse1 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_220)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (select .cse1 .cse2))) (or (not (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|)) (let ((.cse3 (+ .cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse2 .cse3) |c_ULTIMATE.start_main_~a~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) .cse4) .cse3)) (< (+ |c_ULTIMATE.start_main_~i~1#1| 2) |ULTIMATE.start_main_~n~0#1|) (not (= .cse4 0))))))) is different from false [2022-07-13 15:58:20,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_220 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_215 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7))) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| 4 .cse7) v_ArrVal_215))))) (let ((.cse2 (store (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse5 .cse6)))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) v_ArrVal_220)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (or (not (= .cse0 0)) (not (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|)) (< (+ |c_ULTIMATE.start_main_~i~1#1| 2) |ULTIMATE.start_main_~n~0#1|) (let ((.cse4 (+ .cse0 (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|)))) (= (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse4) |ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|)) .cse4))))))) is different from false [2022-07-13 15:58:22,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_220 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_215 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base|) |c_ULTIMATE.start_main_#t~malloc16#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (+ |c_ULTIMATE.start_main_#t~malloc16#1.offset| 4) v_ArrVal_215)))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse5 .cse6)))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) v_ArrVal_220)) (.cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse3 .cse4))) (or (< 2 |ULTIMATE.start_main_~n~0#1|) (not (= .cse0 0)) (let ((.cse1 (+ (select .cse3 |ULTIMATE.start_main_~a~0#1.offset|) .cse0))) (= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 .cse4 .cse1) |ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |c_ULTIMATE.start_main_#t~malloc16#1.offset|) .cse0))) (not (< 1 |ULTIMATE.start_main_~n~0#1|))))))) is different from false [2022-07-13 15:58:22,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_upsweep_~left~0#1| Int) (v_ArrVal_220 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (|v_ULTIMATE.start_upsweep_~right~0#1_7| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_215 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store v_ArrVal_226 |c_ULTIMATE.start_main_#t~malloc16#1.offset| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (+ |c_ULTIMATE.start_main_#t~malloc16#1.offset| 4) v_ArrVal_215)))) (let ((.cse2 (store (let ((.cse6 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|)) (.cse5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|))))) (+ |ULTIMATE.start_main_~a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~n~0#1| 4)) v_ArrVal_220)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (or (not (= .cse0 0)) (< 2 |ULTIMATE.start_main_~n~0#1|) (let ((.cse4 (+ .cse0 (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|)))) (= (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse4) |ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |c_ULTIMATE.start_main_#t~malloc16#1.offset|) .cse0) .cse4)) (not (< 1 |ULTIMATE.start_main_~n~0#1|))))))) is different from false [2022-07-13 15:58:22,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211974942] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:22,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:58:22,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 28] total 35 [2022-07-13 15:58:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944326338] [2022-07-13 15:58:22,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:22,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-13 15:58:22,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:22,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-13 15:58:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2153, Unknown=22, NotChecked=594, Total=2970 [2022-07-13 15:58:22,467 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 32 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 15:58:24,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:26,164 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-07-13 15:58:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-13 15:58:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 32 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-07-13 15:58:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:26,165 INFO L225 Difference]: With dead ends: 140 [2022-07-13 15:58:26,165 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 15:58:26,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=452, Invalid=4951, Unknown=23, NotChecked=894, Total=6320 [2022-07-13 15:58:26,167 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:26,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 485 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 366 Invalid, 1 Unknown, 486 Unchecked, 2.5s Time] [2022-07-13 15:58:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 15:58:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 85. [2022-07-13 15:58:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-07-13 15:58:26,177 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 53 [2022-07-13 15:58:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:26,177 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-07-13 15:58:26,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 32 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 15:58:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-07-13 15:58:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 15:58:26,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:26,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:26,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:26,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:26,392 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1645706784, now seen corresponding path program 2 times [2022-07-13 15:58:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553251210] [2022-07-13 15:58:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:26,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:26,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:58:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:58:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:26,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:58:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:58:26,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:26,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553251210] [2022-07-13 15:58:26,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553251210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:26,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629256904] [2022-07-13 15:58:26,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:58:26,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:26,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:26,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:26,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 15:58:26,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:58:26,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:26,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:58:26,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:58:26,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:58:26,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629256904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:26,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:58:26,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-07-13 15:58:26,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972970793] [2022-07-13 15:58:26,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:26,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:58:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:58:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-07-13 15:58:26,779 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:28,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:29,422 INFO L93 Difference]: Finished difference Result 160 states and 198 transitions. [2022-07-13 15:58:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 15:58:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-13 15:58:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:29,423 INFO L225 Difference]: With dead ends: 160 [2022-07-13 15:58:29,423 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 15:58:29,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2022-07-13 15:58:29,425 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 115 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:29,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 409 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 370 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 15:58:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 15:58:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2022-07-13 15:58:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.2) internal successors, (90), 75 states have internal predecessors, (90), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2022-07-13 15:58:29,449 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 55 [2022-07-13 15:58:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:29,450 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2022-07-13 15:58:29,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2022-07-13 15:58:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 15:58:29,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:29,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:29,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:29,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:29,668 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:29,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash 59219556, now seen corresponding path program 1 times [2022-07-13 15:58:29,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:29,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835272986] [2022-07-13 15:58:29,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:58:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:29,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:58:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:58:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:58:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835272986] [2022-07-13 15:58:29,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835272986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232193253] [2022-07-13 15:58:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:29,788 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:29,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 15:58:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:29,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:58:29,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:58:29,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:58:30,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232193253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:30,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:58:30,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-07-13 15:58:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572555609] [2022-07-13 15:58:30,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:30,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 15:58:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 15:58:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-13 15:58:30,063 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:32,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:34,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:35,137 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2022-07-13 15:58:35,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 15:58:35,137 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-13 15:58:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:35,138 INFO L225 Difference]: With dead ends: 207 [2022-07-13 15:58:35,138 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 15:58:35,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 15:58:35,139 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 207 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:35,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 530 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 509 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-07-13 15:58:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 15:58:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 103. [2022-07-13 15:58:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 92 states have internal predecessors, (111), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-07-13 15:58:35,156 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 55 [2022-07-13 15:58:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:35,157 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-07-13 15:58:35,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-07-13 15:58:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 15:58:35,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:35,157 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:35,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:35,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 15:58:35,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 576449656, now seen corresponding path program 3 times [2022-07-13 15:58:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:35,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034890909] [2022-07-13 15:58:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:35,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 15:58:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 15:58:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 15:58:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 15:58:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:35,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034890909] [2022-07-13 15:58:35,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034890909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:35,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017697910] [2022-07-13 15:58:35,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:58:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:35,451 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:35,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 15:58:35,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 15:58:35,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:35,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 15:58:35,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 15:58:36,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 15:58:36,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017697910] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:36,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:58:36,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 16] total 36 [2022-07-13 15:58:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345628174] [2022-07-13 15:58:36,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:36,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 15:58:36,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 15:58:36,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 15:58:36,529 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 36 states, 34 states have (on average 3.0) internal successors, (102), 35 states have internal predecessors, (102), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 15:58:38,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:40,179 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2022-07-13 15:58:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-13 15:58:40,180 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 3.0) internal successors, (102), 35 states have internal predecessors, (102), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 56 [2022-07-13 15:58:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:40,181 INFO L225 Difference]: With dead ends: 242 [2022-07-13 15:58:40,181 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 15:58:40,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=586, Invalid=2954, Unknown=0, NotChecked=0, Total=3540 [2022-07-13 15:58:40,182 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 275 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 72 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:40,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 414 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 650 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-07-13 15:58:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 15:58:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 137. [2022-07-13 15:58:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.2142857142857142) internal successors, (153), 126 states have internal predecessors, (153), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2022-07-13 15:58:40,202 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 56 [2022-07-13 15:58:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:40,202 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2022-07-13 15:58:40,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 3.0) internal successors, (102), 35 states have internal predecessors, (102), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 15:58:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2022-07-13 15:58:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 15:58:40,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:40,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:40,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:40,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:40,406 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:40,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1049644789, now seen corresponding path program 2 times [2022-07-13 15:58:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181769979] [2022-07-13 15:58:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:58:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:40,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:58:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:40,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:58:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 15:58:40,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:40,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181769979] [2022-07-13 15:58:40,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181769979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:40,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279599563] [2022-07-13 15:58:40,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:58:40,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:40,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:40,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:40,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 15:58:40,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:58:40,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:40,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 15:58:40,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:58:40,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 15:58:40,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279599563] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:40,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:58:40,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 8] total 25 [2022-07-13 15:58:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002087923] [2022-07-13 15:58:40,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:40,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 15:58:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:40,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 15:58:40,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-07-13 15:58:40,994 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:43,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:44,001 INFO L93 Difference]: Finished difference Result 207 states and 252 transitions. [2022-07-13 15:58:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:58:44,002 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-13 15:58:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:44,003 INFO L225 Difference]: With dead ends: 207 [2022-07-13 15:58:44,003 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 15:58:44,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=1361, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 15:58:44,004 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 251 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:44,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 507 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 814 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-07-13 15:58:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 15:58:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2022-07-13 15:58:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 126 states have internal predecessors, (151), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2022-07-13 15:58:44,024 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 57 [2022-07-13 15:58:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:44,024 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2022-07-13 15:58:44,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2022-07-13 15:58:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 15:58:44,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:44,025 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:44,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:44,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 15:58:44,236 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash 116417284, now seen corresponding path program 3 times [2022-07-13 15:58:44,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:44,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316733987] [2022-07-13 15:58:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:44,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:44,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:58:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:58:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:58:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 15:58:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:44,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316733987] [2022-07-13 15:58:44,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316733987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:44,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166290933] [2022-07-13 15:58:44,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:58:44,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:44,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:44,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:44,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 15:58:44,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 15:58:44,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:44,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:58:44,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 15:58:44,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 15:58:44,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166290933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:44,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:58:44,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-13 15:58:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536655979] [2022-07-13 15:58:44,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:44,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 15:58:44,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:44,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 15:58:44,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-07-13 15:58:44,660 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:46,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:47,303 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2022-07-13 15:58:47,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 15:58:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2022-07-13 15:58:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:47,305 INFO L225 Difference]: With dead ends: 225 [2022-07-13 15:58:47,305 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 15:58:47,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 15:58:47,306 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 220 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:47,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 378 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 15:58:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 15:58:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 144. [2022-07-13 15:58:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 133 states have internal predecessors, (161), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2022-07-13 15:58:47,333 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 58 [2022-07-13 15:58:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:47,333 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2022-07-13 15:58:47,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2022-07-13 15:58:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 15:58:47,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:47,334 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:47,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-13 15:58:47,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 15:58:47,535 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:47,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1156626236, now seen corresponding path program 4 times [2022-07-13 15:58:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:47,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868713413] [2022-07-13 15:58:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:58:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:47,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:58:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:58:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 15:58:47,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:47,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868713413] [2022-07-13 15:58:47,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868713413] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:47,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888035153] [2022-07-13 15:58:47,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:58:47,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:47,611 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:47,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 15:58:47,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:58:47,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:47,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 15:58:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 15:58:47,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 15:58:47,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888035153] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:47,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:58:47,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-07-13 15:58:47,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766671758] [2022-07-13 15:58:47,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:47,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:58:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:47,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:58:47,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:58:47,783 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:49,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 15:58:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:50,185 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2022-07-13 15:58:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:58:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2022-07-13 15:58:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:50,187 INFO L225 Difference]: With dead ends: 187 [2022-07-13 15:58:50,187 INFO L226 Difference]: Without dead ends: 160 [2022-07-13 15:58:50,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-07-13 15:58:50,187 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:50,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 288 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 15:58:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-13 15:58:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2022-07-13 15:58:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 108 states have internal predecessors, (130), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2022-07-13 15:58:50,206 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 58 [2022-07-13 15:58:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:50,206 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2022-07-13 15:58:50,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2022-07-13 15:58:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 15:58:50,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:50,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:50,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:50,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 15:58:50,417 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash -4426440, now seen corresponding path program 5 times [2022-07-13 15:58:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:50,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586230760] [2022-07-13 15:58:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:58:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:58:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:58:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 15:58:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:50,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586230760] [2022-07-13 15:58:50,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586230760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160420063] [2022-07-13 15:58:50,499 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 15:58:50,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:50,500 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:50,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 15:58:50,761 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 15:58:50,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:50,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 15:58:50,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 15:58:50,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 15:58:51,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160420063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:51,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:58:51,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 21 [2022-07-13 15:58:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649043367] [2022-07-13 15:58:51,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:51,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 15:58:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:58:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 15:58:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-07-13 15:58:51,122 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:51,997 INFO L93 Difference]: Finished difference Result 285 states and 367 transitions. [2022-07-13 15:58:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 15:58:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2022-07-13 15:58:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:51,999 INFO L225 Difference]: With dead ends: 285 [2022-07-13 15:58:51,999 INFO L226 Difference]: Without dead ends: 276 [2022-07-13 15:58:51,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=622, Invalid=1828, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 15:58:52,000 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 221 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:52,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 372 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:58:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-13 15:58:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 124. [2022-07-13 15:58:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 113 states have internal predecessors, (137), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 15:58:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2022-07-13 15:58:52,026 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 61 [2022-07-13 15:58:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:52,026 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2022-07-13 15:58:52,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 15:58:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2022-07-13 15:58:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 15:58:52,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:52,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:52,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:52,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 15:58:52,242 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 108996138, now seen corresponding path program 6 times [2022-07-13 15:58:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:58:52,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713751988] [2022-07-13 15:58:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:58:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:58:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 15:58:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:58:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:52,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:58:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 15:58:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:58:52,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713751988] [2022-07-13 15:58:52,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713751988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:52,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061790927] [2022-07-13 15:58:52,356 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 15:58:52,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:58:52,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:58:52,360 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:58:52,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 15:58:52,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 15:58:52,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:52,449 WARN L261 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 151 conjunts are in the unsatisfiable core [2022-07-13 15:58:52,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:52,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:58:52,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:58:52,550 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:58:52,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:58:52,576 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_563 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_563) |c_#memory_int|)) is different from true [2022-07-13 15:58:52,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-07-13 15:58:52,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-13 15:58:52,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-13 15:58:52,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 33 treesize of output 29 [2022-07-13 15:58:52,717 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-13 15:58:52,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2022-07-13 15:58:52,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-13 15:58:52,824 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-13 15:58:52,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2022-07-13 15:58:53,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-13 15:58:53,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-07-13 15:58:57,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 45 treesize of output 43 [2022-07-13 15:59:01,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2022-07-13 15:59:04,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 71 treesize of output 63 [2022-07-13 15:59:23,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 143 [2022-07-13 15:59:23,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 169 treesize of output 163 [2022-07-13 15:59:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2022-07-13 15:59:23,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:00:57,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 Int) (|v_ULTIMATE.start_main_~i~1#1_48| Int) (|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_14| Int) (v_ArrVal_574 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_29| Int) (v_ArrVal_570 Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_569 Int) (v_ArrVal_567 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (let ((.cse5 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse5)))) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_48| 4)) v_ArrVal_567) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_569)))) (let ((.cse2 (store (store (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_29| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_14|) v_ArrVal_570) (+ |v_ULTIMATE.start_upsweep_~a#1.offset_14| 12) v_ArrVal_574) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_577)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (or (<= |ULTIMATE.start_main_~n~0#1| 2) (not (<= |v_ULTIMATE.start_main_~i~1#1_47| (+ |v_ULTIMATE.start_main_~i~1#1_48| 1))) (not (<= |v_ULTIMATE.start_main_~i~1#1_48| (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (not (<= 1 |v_ULTIMATE.start_upsweep_~right~0#1_29|)) (< |v_ULTIMATE.start_upsweep_~a#1.offset_14| |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse0 0)) (< (+ |v_ULTIMATE.start_main_~i~1#1_47| 1) |ULTIMATE.start_main_~n~0#1|) (let ((.cse4 (+ .cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse4) |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) .cse4))))))) is different from false [2022-07-13 16:00:59,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 Int) (|v_ULTIMATE.start_main_~i~1#1_48| Int) (|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_14| Int) (v_ArrVal_574 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_29| Int) (v_ArrVal_570 Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_569 Int) (v_ArrVal_567 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base|) |c_ULTIMATE.start_main_#t~malloc16#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ |c_ULTIMATE.start_main_#t~malloc16#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_48| 4)) v_ArrVal_567) (+ |c_ULTIMATE.start_main_#t~malloc16#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_569)))) (let ((.cse2 (store (store (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_29| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_14|) v_ArrVal_570) (+ |v_ULTIMATE.start_upsweep_~a#1.offset_14| 12) v_ArrVal_574) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_577)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (or (<= |ULTIMATE.start_main_~n~0#1| 2) (not (<= |v_ULTIMATE.start_main_~i~1#1_47| (+ |v_ULTIMATE.start_main_~i~1#1_48| 1))) (not (= .cse0 0)) (not (<= |v_ULTIMATE.start_main_~i~1#1_48| 1)) (not (<= 1 |v_ULTIMATE.start_upsweep_~right~0#1_29|)) (< |v_ULTIMATE.start_upsweep_~a#1.offset_14| |c_ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse4 (+ .cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse4) |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |c_ULTIMATE.start_main_#t~malloc16#1.offset|) .cse4)) (< (+ |v_ULTIMATE.start_main_~i~1#1_47| 1) |ULTIMATE.start_main_~n~0#1|)))))) is different from false [2022-07-13 16:00:59,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 Int) (|v_ULTIMATE.start_main_~i~1#1_48| Int) (|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_14| Int) (v_ArrVal_574 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_29| Int) (v_ArrVal_570 Int) (v_ArrVal_583 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_569 Int) (v_ArrVal_567 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store (store v_ArrVal_583 |c_ULTIMATE.start_main_#t~malloc16#1.offset| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ |c_ULTIMATE.start_main_#t~malloc16#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_48| 4)) v_ArrVal_567) (+ |c_ULTIMATE.start_main_#t~malloc16#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_569)))) (let ((.cse2 (store (store (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_29| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_14|) v_ArrVal_570) (+ |v_ULTIMATE.start_upsweep_~a#1.offset_14| 12) v_ArrVal_574) (+ (- 4) (* |ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_577)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse2 .cse3))) (or (not (= .cse0 0)) (<= |ULTIMATE.start_main_~n~0#1| 2) (not (<= |v_ULTIMATE.start_main_~i~1#1_47| (+ |v_ULTIMATE.start_main_~i~1#1_48| 1))) (not (<= |v_ULTIMATE.start_main_~i~1#1_48| 1)) (let ((.cse4 (+ .cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse4) |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |c_ULTIMATE.start_main_#t~malloc16#1.offset|) .cse4)) (not (<= 1 |v_ULTIMATE.start_upsweep_~right~0#1_29|)) (< |v_ULTIMATE.start_upsweep_~a#1.offset_14| |c_ULTIMATE.start_main_~a~0#1.offset|) (< (+ |v_ULTIMATE.start_main_~i~1#1_47| 1) |ULTIMATE.start_main_~n~0#1|)))))) is different from false [2022-07-13 16:00:59,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061790927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:00:59,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:00:59,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 36] total 43 [2022-07-13 16:00:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276246912] [2022-07-13 16:00:59,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:00:59,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 16:00:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:00:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 16:00:59,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=4131, Unknown=49, NotChecked=540, Total=5112 [2022-07-13 16:00:59,632 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand has 43 states, 42 states have (on average 2.119047619047619) internal successors, (89), 40 states have internal predecessors, (89), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 16:01:01,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 16:01:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:01:07,481 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2022-07-13 16:01:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-13 16:01:07,481 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.119047619047619) internal successors, (89), 40 states have internal predecessors, (89), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-07-13 16:01:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:01:07,482 INFO L225 Difference]: With dead ends: 184 [2022-07-13 16:01:07,482 INFO L226 Difference]: Without dead ends: 151 [2022-07-13 16:01:07,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2262 ImplicationChecksByTransitivity, 129.6s TimeCoverageRelationStatistics Valid=918, Invalid=9554, Unknown=50, NotChecked=820, Total=11342 [2022-07-13 16:01:07,485 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 156 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 114 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 889 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 16:01:07,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 700 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 719 Invalid, 1 Unknown, 889 Unchecked, 2.8s Time] [2022-07-13 16:01:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-13 16:01:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2022-07-13 16:01:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 111 states have internal predecessors, (134), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 16:01:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2022-07-13 16:01:07,520 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 64 [2022-07-13 16:01:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:01:07,521 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2022-07-13 16:01:07,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.119047619047619) internal successors, (89), 40 states have internal predecessors, (89), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 16:01:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2022-07-13 16:01:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 16:01:07,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:01:07,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:01:07,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 16:01:07,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:01:07,732 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:01:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:01:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash -172349620, now seen corresponding path program 7 times [2022-07-13 16:01:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:01:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076462473] [2022-07-13 16:01:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:01:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:01:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 16:01:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 16:01:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:07,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 16:01:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 16:01:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 16:01:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:01:07,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076462473] [2022-07-13 16:01:07,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076462473] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:01:07,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175713495] [2022-07-13 16:01:07,874 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 16:01:07,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:01:07,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:01:07,876 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:01:07,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 16:01:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:07,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 16:01:07,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:01:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 16:01:08,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:01:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 16:01:08,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175713495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:01:08,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 16:01:08,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 19 [2022-07-13 16:01:08,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926261767] [2022-07-13 16:01:08,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 16:01:08,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 16:01:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:01:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 16:01:08,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-07-13 16:01:08,271 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 16:01:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:01:09,091 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2022-07-13 16:01:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 16:01:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2022-07-13 16:01:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:01:09,092 INFO L225 Difference]: With dead ends: 183 [2022-07-13 16:01:09,092 INFO L226 Difference]: Without dead ends: 174 [2022-07-13 16:01:09,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 16:01:09,093 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 187 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 16:01:09,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 551 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 16:01:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-13 16:01:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2022-07-13 16:01:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 112 states have internal predecessors, (136), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 16:01:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2022-07-13 16:01:09,129 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 66 [2022-07-13 16:01:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:01:09,129 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2022-07-13 16:01:09,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 18 states have internal predecessors, (59), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 16:01:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2022-07-13 16:01:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 16:01:09,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:01:09,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:01:09,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 16:01:09,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 16:01:09,337 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:01:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:01:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash -302690491, now seen corresponding path program 8 times [2022-07-13 16:01:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:01:09,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194215123] [2022-07-13 16:01:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:01:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:01:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 16:01:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 16:01:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 16:01:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 16:01:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 16:01:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:01:09,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194215123] [2022-07-13 16:01:09,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194215123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:01:09,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036461484] [2022-07-13 16:01:09,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:01:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:01:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:01:09,535 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:01:09,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 16:01:09,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:01:09,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:01:09,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 16:01:09,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:01:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 16:01:10,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:01:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 16:01:10,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036461484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:01:10,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 16:01:10,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2022-07-13 16:01:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151167193] [2022-07-13 16:01:10,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 16:01:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 16:01:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:01:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 16:01:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-07-13 16:01:10,429 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 16:01:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:01:11,341 INFO L93 Difference]: Finished difference Result 180 states and 221 transitions. [2022-07-13 16:01:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 16:01:11,341 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2022-07-13 16:01:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:01:11,342 INFO L225 Difference]: With dead ends: 180 [2022-07-13 16:01:11,342 INFO L226 Difference]: Without dead ends: 164 [2022-07-13 16:01:11,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 16:01:11,343 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 191 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 16:01:11,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 280 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 16:01:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-13 16:01:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2022-07-13 16:01:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 16:01:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2022-07-13 16:01:11,382 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 67 [2022-07-13 16:01:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:01:11,382 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2022-07-13 16:01:11,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 16:01:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2022-07-13 16:01:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 16:01:11,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:01:11,382 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:01:11,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 16:01:11,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:01:11,595 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:01:11,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:01:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash -195035670, now seen corresponding path program 9 times [2022-07-13 16:01:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:01:11,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114130078] [2022-07-13 16:01:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:01:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:01:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:12,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 16:01:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 16:01:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 16:01:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 16:01:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:01:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 16:01:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:01:12,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114130078] [2022-07-13 16:01:12,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114130078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 16:01:12,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937781817] [2022-07-13 16:01:12,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 16:01:12,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:01:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:01:12,422 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:01:12,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 16:01:12,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 16:01:12,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:01:12,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-13 16:01:12,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:01:21,236 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (and (= (div .cse0 2) |c_ULTIMATE.start_is_pow2_~x#1|) (< 1 .cse0))) is different from false