./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 eb692b52 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-?-eb692b5 [2022-07-19 15:24:03,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:24:03,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:24:03,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:24:03,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:24:03,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:24:03,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:24:03,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:24:03,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:24:03,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:24:03,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:24:03,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:24:03,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:24:03,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:24:03,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:24:03,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:24:03,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:24:03,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:24:03,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:24:03,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:24:03,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:24:03,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:24:03,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:24:03,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:24:03,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:24:03,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:24:03,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:24:03,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:24:03,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:24:03,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:24:03,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:24:03,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:24:03,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:24:03,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:24:03,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:24:03,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:24:03,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:24:03,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:24:03,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:24:03,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:24:03,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:24:03,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:24:03,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:24:03,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:24:03,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:24:03,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:24:03,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:24:03,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:24:03,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:24:03,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:24:03,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:24:03,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:24:03,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:24:03,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:24:03,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:24:03,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:24:03,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:24:03,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:24:03,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:24:03,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:24:03,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:24:03,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:24:03,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:24:03,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:24:03,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:24:03,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:24:03,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:24:03,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:24:03,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:24:03,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:24:03,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:24:03,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:24:03,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:24:03,534 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:24:03,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:24:03,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:24:03,534 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-19 15:24:03,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:24:03,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:24:03,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:24:03,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:24:03,815 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:24:03,817 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-19 15:24:03,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aef0ccc3/7cf7b61568b64337a15d5198a8ed7b57/FLAG7171472ef [2022-07-19 15:24:04,317 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:24:04,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-07-19 15:24:04,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aef0ccc3/7cf7b61568b64337a15d5198a8ed7b57/FLAG7171472ef [2022-07-19 15:24:04,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aef0ccc3/7cf7b61568b64337a15d5198a8ed7b57 [2022-07-19 15:24:04,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:24:04,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:24:04,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:24:04,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:24:04,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:24:04,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:24:04" (1/1) ... [2022-07-19 15:24:04,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aeff62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:04, skipping insertion in model container [2022-07-19 15:24:04,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:24:04" (1/1) ... [2022-07-19 15:24:04,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:24:04,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:24:04,905 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-19 15:24:04,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:24:04,968 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:24:04,983 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-19 15:24:05,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:24:05,025 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:24:05,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05 WrapperNode [2022-07-19 15:24:05,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:24:05,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:24:05,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:24:05,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:24:05,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,080 INFO L137 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2022-07-19 15:24:05,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:24:05,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:24:05,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:24:05,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:24:05,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:24:05,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:24:05,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:24:05,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:24:05,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (1/1) ... [2022-07-19 15:24:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:24:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:05,168 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-19 15:24:05,174 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-19 15:24:05,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:24:05,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 15:24:05,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 15:24:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:24:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 15:24:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 15:24:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:24:05,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:24:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 15:24:05,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-19 15:24:05,215 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-19 15:24:05,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 15:24:05,314 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:24:05,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:24:05,528 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:24:05,532 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:24:05,533 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-19 15:24:05,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:24:05 BoogieIcfgContainer [2022-07-19 15:24:05,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:24:05,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:24:05,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:24:05,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:24:05,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:24:04" (1/3) ... [2022-07-19 15:24:05,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f4bde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:24:05, skipping insertion in model container [2022-07-19 15:24:05,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:24:05" (2/3) ... [2022-07-19 15:24:05,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f4bde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:24:05, skipping insertion in model container [2022-07-19 15:24:05,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:24:05" (3/3) ... [2022-07-19 15:24:05,554 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-07-19 15:24:05,566 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:24:05,566 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:24:05,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:24:05,612 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@cea22ce, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e035ef3 [2022-07-19 15:24:05,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:24:05,616 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-19 15:24:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 15:24:05,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:05,624 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-19 15:24:05,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash -750888739, now seen corresponding path program 1 times [2022-07-19 15:24:05,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:05,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453916903] [2022-07-19 15:24:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:05,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:05,861 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-19 15:24:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:05,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453916903] [2022-07-19 15:24:05,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453916903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:05,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:05,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 15:24:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084297076] [2022-07-19 15:24:05,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:05,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 15:24:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:05,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 15:24:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 15:24:05,892 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-19 15:24:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:05,960 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2022-07-19 15:24:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 15:24:05,968 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-19 15:24:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:05,972 INFO L225 Difference]: With dead ends: 81 [2022-07-19 15:24:05,973 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 15:24:05,975 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-19 15:24:05,978 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-19 15:24:05,979 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-19 15:24:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 15:24:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-19 15:24:06,012 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-19 15:24:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-19 15:24:06,014 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-07-19 15:24:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:06,015 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-19 15:24:06,015 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-19 15:24:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-19 15:24:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 15:24:06,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:06,017 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-19 15:24:06,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 15:24:06,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash 221792227, now seen corresponding path program 1 times [2022-07-19 15:24:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:06,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808806044] [2022-07-19 15:24:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:06,198 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-19 15:24:06,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:06,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808806044] [2022-07-19 15:24:06,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808806044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:06,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:06,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 15:24:06,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316957850] [2022-07-19 15:24:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:06,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 15:24:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:06,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 15:24:06,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 15:24:06,202 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-19 15:24:08,237 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-19 15:24:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:08,618 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2022-07-19 15:24:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 15:24:08,619 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-19 15:24:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:08,620 INFO L225 Difference]: With dead ends: 97 [2022-07-19 15:24:08,620 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 15:24:08,622 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-19 15:24:08,623 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 72 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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-19 15:24:08,623 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-19 15:24:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 15:24:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2022-07-19 15:24:08,630 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-19 15:24:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-19 15:24:08,631 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2022-07-19 15:24:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:08,632 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-19 15:24:08,632 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-19 15:24:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-19 15:24:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 15:24:08,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:08,633 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-19 15:24:08,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 15:24:08,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash 747513669, now seen corresponding path program 1 times [2022-07-19 15:24:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:08,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923454897] [2022-07-19 15:24:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:08,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:08,974 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-19 15:24:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:08,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923454897] [2022-07-19 15:24:08,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923454897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:08,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160408335] [2022-07-19 15:24:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:08,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:08,978 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-19 15:24:09,003 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-19 15:24:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:09,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 15:24:09,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:09,140 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-19 15:24:09,195 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-19 15:24:09,284 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 15:24:09,285 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-19 15:24:09,309 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-19 15:24:09,324 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-19 15:24:09,346 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-19 15:24:09,406 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-19 15:24:09,511 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-19 15:24:09,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:24:32,423 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-19 15:24:32,475 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-19 15:24:32,490 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-19 15:24:32,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160408335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:32,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:24:32,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 17 [2022-07-19 15:24:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122529861] [2022-07-19 15:24:32,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:24:32,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 15:24:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 15:24:32,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=251, Unknown=15, NotChecked=140, Total=462 [2022-07-19 15:24:32,530 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-19 15:24:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:42,929 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-19 15:24:42,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 15:24:42,930 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-19 15:24:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:42,931 INFO L225 Difference]: With dead ends: 49 [2022-07-19 15:24:42,931 INFO L226 Difference]: Without dead ends: 47 [2022-07-19 15:24:42,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=129, Invalid=569, Unknown=20, NotChecked=212, Total=930 [2022-07-19 15:24:42,933 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:42,933 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.2s Time] [2022-07-19 15:24:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-19 15:24:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-07-19 15:24:42,939 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-19 15:24:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-19 15:24:42,940 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 39 [2022-07-19 15:24:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:42,941 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-19 15:24:42,941 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-19 15:24:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-19 15:24:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 15:24:42,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:42,942 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-19 15:24:42,968 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-19 15:24:43,163 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-19 15:24:43,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1715230204, now seen corresponding path program 1 times [2022-07-19 15:24:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:43,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067867399] [2022-07-19 15:24:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:43,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:43,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:43,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:43,306 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-19 15:24:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:43,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067867399] [2022-07-19 15:24:43,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067867399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:43,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830502979] [2022-07-19 15:24:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:43,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:43,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:43,321 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-19 15:24:43,323 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-19 15:24:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:43,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 15:24:43,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:43,540 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-19 15:24:43,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:24:43,617 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-19 15:24:43,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830502979] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:24:43,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:24:43,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-07-19 15:24:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210950736] [2022-07-19 15:24:43,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:24:43,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 15:24:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:43,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 15:24:43,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-19 15:24:43,621 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-19 15:24:45,658 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-19 15:24:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:46,072 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-07-19 15:24:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 15:24:46,073 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-19 15:24:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:46,074 INFO L225 Difference]: With dead ends: 116 [2022-07-19 15:24:46,074 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 15:24:46,075 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-19 15:24:46,076 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 115 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:46,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 179 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 15:24:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 15:24:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 46. [2022-07-19 15:24:46,084 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-19 15:24:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-19 15:24:46,085 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2022-07-19 15:24:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:46,085 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-19 15:24:46,086 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-19 15:24:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-19 15:24:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 15:24:46,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:46,087 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-19 15:24:46,114 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-19 15:24:46,303 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-19 15:24:46,304 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1080974370, now seen corresponding path program 2 times [2022-07-19 15:24:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:46,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624529600] [2022-07-19 15:24:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:46,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:46,422 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-19 15:24:46,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:46,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624529600] [2022-07-19 15:24:46,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624529600] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:46,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062920593] [2022-07-19 15:24:46,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:24:46,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:46,426 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-19 15:24:46,452 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-19 15:24:46,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:24:46,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:24:46,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:24:46,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:46,618 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-19 15:24:46,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:24:46,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062920593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:46,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:24:46,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-07-19 15:24:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355208533] [2022-07-19 15:24:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:46,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:24:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:24:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 15:24:46,620 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-19 15:24:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:46,743 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-07-19 15:24:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:24:46,743 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-19 15:24:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:46,744 INFO L225 Difference]: With dead ends: 66 [2022-07-19 15:24:46,744 INFO L226 Difference]: Without dead ends: 49 [2022-07-19 15:24:46,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-19 15:24:46,746 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 15:24:46,746 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-19 15:24:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-19 15:24:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-07-19 15:24:46,751 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-19 15:24:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-07-19 15:24:46,752 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 45 [2022-07-19 15:24:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:46,752 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-07-19 15:24:46,752 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-19 15:24:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-07-19 15:24:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 15:24:46,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:46,754 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-19 15:24:46,779 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-19 15:24:46,974 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-19 15:24:46,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:46,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1924122647, now seen corresponding path program 1 times [2022-07-19 15:24:46,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:46,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363250532] [2022-07-19 15:24:46,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,070 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-19 15:24:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:47,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363250532] [2022-07-19 15:24:47,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363250532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:47,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:24:47,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 15:24:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443251945] [2022-07-19 15:24:47,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:47,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 15:24:47,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:47,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 15:24:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 15:24:47,073 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-19 15:24:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:47,115 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-07-19 15:24:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 15:24:47,117 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-19 15:24:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:47,120 INFO L225 Difference]: With dead ends: 65 [2022-07-19 15:24:47,120 INFO L226 Difference]: Without dead ends: 48 [2022-07-19 15:24:47,120 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-19 15:24:47,123 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-19 15:24:47,123 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-19 15:24:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-19 15:24:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-19 15:24:47,140 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-19 15:24:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-19 15:24:47,142 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 48 [2022-07-19 15:24:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:47,142 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-19 15:24:47,143 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-19 15:24:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-19 15:24:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 15:24:47,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:47,144 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-19 15:24:47,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 15:24:47,144 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:47,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1397539149, now seen corresponding path program 1 times [2022-07-19 15:24:47,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:47,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233244331] [2022-07-19 15:24:47,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:47,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,289 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-19 15:24:47,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233244331] [2022-07-19 15:24:47,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233244331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:47,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235877519] [2022-07-19 15:24:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:47,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:47,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:47,296 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-19 15:24:47,329 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-19 15:24:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 15:24:47,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:47,470 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-19 15:24:47,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 15:24:47,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235877519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:24:47,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 15:24:47,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2022-07-19 15:24:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141201008] [2022-07-19 15:24:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:24:47,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:24:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:24:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 15:24:47,475 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-19 15:24:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:47,543 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-07-19 15:24:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:24:47,545 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-19 15:24:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:47,545 INFO L225 Difference]: With dead ends: 61 [2022-07-19 15:24:47,545 INFO L226 Difference]: Without dead ends: 52 [2022-07-19 15:24:47,546 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-19 15:24:47,546 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-19 15:24:47,547 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-19 15:24:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-19 15:24:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-07-19 15:24:47,551 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-19 15:24:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-19 15:24:47,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2022-07-19 15:24:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:47,552 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-19 15:24:47,553 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-19 15:24:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-19 15:24:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 15:24:47,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:47,553 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-19 15:24:47,579 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-19 15:24:47,754 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-19 15:24:47,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:47,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1418623757, now seen corresponding path program 1 times [2022-07-19 15:24:47,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:47,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276958781] [2022-07-19 15:24:47,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:47,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,916 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-19 15:24:47,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:47,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276958781] [2022-07-19 15:24:47,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276958781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:47,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918925014] [2022-07-19 15:24:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:47,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:47,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:47,918 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-19 15:24:47,919 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-19 15:24:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:47,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 15:24:47,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:48,149 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-19 15:24:48,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:24:48,316 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-19 15:24:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918925014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:24:48,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:24:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2022-07-19 15:24:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249955156] [2022-07-19 15:24:48,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:24:48,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 15:24:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:24:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 15:24:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:24:48,318 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-19 15:24:50,390 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-19 15:24:52,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:24:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:24:53,293 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2022-07-19 15:24:53,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 15:24:53,294 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-19 15:24:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:24:53,295 INFO L225 Difference]: With dead ends: 99 [2022-07-19 15:24:53,295 INFO L226 Difference]: Without dead ends: 90 [2022-07-19 15:24:53,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2022-07-19 15:24:53,296 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 101 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-19 15:24:53,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 323 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 354 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-07-19 15:24:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-19 15:24:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 51. [2022-07-19 15:24:53,304 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-19 15:24:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-19 15:24:53,304 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 52 [2022-07-19 15:24:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:24:53,305 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-19 15:24:53,305 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-19 15:24:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-19 15:24:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 15:24:53,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:24:53,306 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-19 15:24:53,334 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-19 15:24:53,514 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-19 15:24:53,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:24:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:24:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash -282483074, now seen corresponding path program 1 times [2022-07-19 15:24:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:24:53,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059708141] [2022-07-19 15:24:53,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:24:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:53,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:24:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:24:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:24:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:24:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:53,796 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-19 15:24:53,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:24:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059708141] [2022-07-19 15:24:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059708141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:24:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839175021] [2022-07-19 15:24:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:24:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:24:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:24:53,800 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-19 15:24:53,828 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-19 15:24:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:24:53,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-19 15:24:53,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:24:53,915 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-19 15:24:53,960 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-19 15:24:54,066 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 15:24:54,067 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-19 15:24:54,104 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-19 15:24:54,115 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-19 15:24:54,161 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-19 15:24:54,165 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-19 15:24:54,262 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-19 15:24:54,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 15:24:54,269 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-19 15:24:54,539 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-19 15:24:54,846 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-19 15:24:56,284 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-19 15:25:04,268 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-19 15:25:04,277 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-19 15:25:04,340 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-19 15:25:04,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:14,900 WARN L833 $PredicateComparison]: unable to prove that (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)) (let ((.cse1 (store (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_7| 4) |ULTIMATE.start_upsweep_~a#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 (+ (* 4 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~a#1.offset|)) (select .cse4 .cse5)))) (+ (- 4) (* |c_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 ((.cse3 (select .cse1 .cse2))) (or (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3))) (= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse2 .cse0) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~a0~0#1.base|) |c_ULTIMATE.start_main_~a0~0#1.offset|) .cse3))) (not (= 0 .cse3)))))) is different from false [2022-07-19 15:25:21,693 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-19 15:25:23,811 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-19 15:25:26,004 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-19 15:25:28,135 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-19 15:25:28,243 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-19 15:25:28,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839175021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:28,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 15:25:28,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 28] total 35 [2022-07-19 15:25:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045772719] [2022-07-19 15:25:28,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:28,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-19 15:25:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:25:28,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-19 15:25:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2081, Unknown=11, NotChecked=686, Total=2970 [2022-07-19 15:25:28,252 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-19 15:25:30,350 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-19 15:25:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:32,620 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-07-19 15:25:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-19 15:25:32,620 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-19 15:25:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:32,622 INFO L225 Difference]: With dead ends: 140 [2022-07-19 15:25:32,622 INFO L226 Difference]: Without dead ends: 117 [2022-07-19 15:25:32,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=435, Invalid=4837, Unknown=12, NotChecked=1036, Total=6320 [2022-07-19 15:25:32,625 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:32,625 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.6s Time] [2022-07-19 15:25:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-19 15:25:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 85. [2022-07-19 15:25:32,638 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-19 15:25:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-07-19 15:25:32,639 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 53 [2022-07-19 15:25:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:32,639 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-07-19 15:25:32,640 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-19 15:25:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-07-19 15:25:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 15:25:32,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:32,641 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-19 15:25:32,666 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-19 15:25:32,866 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-19 15:25:32,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1645706784, now seen corresponding path program 2 times [2022-07-19 15:25:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:25:32,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647225142] [2022-07-19 15:25:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:25:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:25:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:33,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:25:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:25:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:25:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:33,057 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-19 15:25:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:25:33,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647225142] [2022-07-19 15:25:33,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647225142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:33,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982594748] [2022-07-19 15:25:33,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:25:33,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:25:33,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:25:33,059 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-19 15:25:33,061 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-19 15:25:33,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:25:33,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:33,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 15:25:33,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:33,318 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-19 15:25:33,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:33,428 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-19 15:25:33,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982594748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:25:33,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:25:33,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-07-19 15:25:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282821349] [2022-07-19 15:25:33,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:33,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 15:25:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:25:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 15:25:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-07-19 15:25:33,430 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-19 15:25:35,539 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-19 15:25:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:36,278 INFO L93 Difference]: Finished difference Result 160 states and 198 transitions. [2022-07-19 15:25:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 15:25:36,278 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-19 15:25:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:36,279 INFO L225 Difference]: With dead ends: 160 [2022-07-19 15:25:36,279 INFO L226 Difference]: Without dead ends: 139 [2022-07-19 15:25:36,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2022-07-19 15:25:36,281 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 115 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:36,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 409 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 15:25:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-19 15:25:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2022-07-19 15:25:36,293 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-19 15:25:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2022-07-19 15:25:36,294 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 55 [2022-07-19 15:25:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:36,294 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2022-07-19 15:25:36,294 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-19 15:25:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2022-07-19 15:25:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 15:25:36,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:36,295 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-19 15:25:36,324 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-19 15:25:36,519 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-19 15:25:36,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 59219556, now seen corresponding path program 1 times [2022-07-19 15:25:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:25:36,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151686493] [2022-07-19 15:25:36,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:25:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:25:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 15:25:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:36,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:25:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:25:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:36,671 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-19 15:25:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:25:36,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151686493] [2022-07-19 15:25:36,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151686493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:36,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336861185] [2022-07-19 15:25:36,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:36,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:25:36,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:25:36,676 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-19 15:25:36,678 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-19 15:25:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:36,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 15:25:36,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:36,853 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-19 15:25:36,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:37,034 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-19 15:25:37,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336861185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:25:37,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:25:37,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-07-19 15:25:37,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452701829] [2022-07-19 15:25:37,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:37,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 15:25:37,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:25:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 15:25:37,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-19 15:25:37,036 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-19 15:25:39,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-19 15:25:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:40,388 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2022-07-19 15:25:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 15:25:40,389 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-19 15:25:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:40,390 INFO L225 Difference]: With dead ends: 207 [2022-07-19 15:25:40,390 INFO L226 Difference]: Without dead ends: 192 [2022-07-19 15:25:40,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 15:25:40,392 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 207 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:40,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 530 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 498 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-07-19 15:25:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-19 15:25:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 103. [2022-07-19 15:25:40,410 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-19 15:25:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-07-19 15:25:40,411 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 55 [2022-07-19 15:25:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:40,411 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-07-19 15:25:40,412 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-19 15:25:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-07-19 15:25:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 15:25:40,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:40,413 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-19 15:25:40,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-19 15:25:40,627 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-19 15:25:40,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 576449656, now seen corresponding path program 3 times [2022-07-19 15:25:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:25:40,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577898976] [2022-07-19 15:25:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:40,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:25:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:25:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 15:25:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 15:25:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 15:25:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:40,763 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-19 15:25:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:25:40,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577898976] [2022-07-19 15:25:40,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577898976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:40,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244778621] [2022-07-19 15:25:40,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:25:40,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:25:40,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:25:40,768 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-19 15:25:40,770 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-19 15:25:40,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-19 15:25:40,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:40,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 15:25:40,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:41,626 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-19 15:25:41,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:42,510 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-19 15:25:42,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244778621] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:25:42,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:25:42,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 16] total 36 [2022-07-19 15:25:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633703468] [2022-07-19 15:25:42,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:42,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 15:25:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:25:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 15:25:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 15:25:42,513 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-19 15:25:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:44,623 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2022-07-19 15:25:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 15:25:44,624 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-19 15:25:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:44,625 INFO L225 Difference]: With dead ends: 242 [2022-07-19 15:25:44,625 INFO L226 Difference]: Without dead ends: 181 [2022-07-19 15:25:44,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=586, Invalid=2954, Unknown=0, NotChecked=0, Total=3540 [2022-07-19 15:25:44,627 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 275 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:44,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 414 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 15:25:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-19 15:25:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 137. [2022-07-19 15:25:44,655 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-19 15:25:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2022-07-19 15:25:44,655 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 56 [2022-07-19 15:25:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:44,655 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2022-07-19 15:25:44,656 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-19 15:25:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2022-07-19 15:25:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 15:25:44,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:44,656 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-19 15:25:44,676 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-19 15:25:44,859 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-19 15:25:44,860 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1049644789, now seen corresponding path program 2 times [2022-07-19 15:25:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:25:44,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936351885] [2022-07-19 15:25:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:25:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:25:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 15:25:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:25:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:25:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:45,081 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-19 15:25:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:25:45,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936351885] [2022-07-19 15:25:45,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936351885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:45,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757088215] [2022-07-19 15:25:45,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 15:25:45,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:25:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:25:45,088 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-19 15:25:45,090 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-19 15:25:45,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 15:25:45,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:45,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 15:25:45,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:45,474 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-19 15:25:45,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:45,752 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-19 15:25:45,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757088215] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:25:45,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:25:45,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 8] total 25 [2022-07-19 15:25:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63355032] [2022-07-19 15:25:45,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:45,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 15:25:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:25:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 15:25:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2022-07-19 15:25:45,755 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-19 15:25:47,830 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-19 15:25:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:25:48,996 INFO L93 Difference]: Finished difference Result 207 states and 252 transitions. [2022-07-19 15:25:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 15:25:48,997 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-19 15:25:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:25:48,998 INFO L225 Difference]: With dead ends: 207 [2022-07-19 15:25:48,998 INFO L226 Difference]: Without dead ends: 192 [2022-07-19 15:25:48,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=1361, Unknown=0, NotChecked=0, Total=1640 [2022-07-19 15:25:48,999 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 251 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.7s IncrementalHoareTripleChecker+Time [2022-07-19 15:25:48,999 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.7s Time] [2022-07-19 15:25:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-19 15:25:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2022-07-19 15:25:49,029 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-19 15:25:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2022-07-19 15:25:49,030 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 57 [2022-07-19 15:25:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:25:49,031 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2022-07-19 15:25:49,031 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-19 15:25:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2022-07-19 15:25:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 15:25:49,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:25:49,032 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-19 15:25:49,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-19 15:25:49,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-19 15:25:49,235 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:25:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:25:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 116417284, now seen corresponding path program 3 times [2022-07-19 15:25:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:25:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237692979] [2022-07-19 15:25:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:25:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:25:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:49,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:25:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 15:25:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:25:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:25:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:25:49,354 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-19 15:25:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:25:49,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237692979] [2022-07-19 15:25:49,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237692979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:25:49,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489713343] [2022-07-19 15:25:49,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 15:25:49,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:25:49,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:25:49,356 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-19 15:25:49,357 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-19 15:25:49,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 15:25:49,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:25:49,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 15:25:49,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:25:49,624 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-19 15:25:49,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:25:49,791 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-19 15:25:49,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489713343] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:25:49,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:25:49,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-19 15:25:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958753542] [2022-07-19 15:25:49,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:25:49,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 15:25:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:25:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 15:25:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-07-19 15:25:49,793 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-19 15:25:51,861 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-19 15:25:53,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:25:56,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:25:58,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 15:26:00,344 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-19 15:26:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:26:01,122 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2022-07-19 15:26:01,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 15:26:01,122 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-19 15:26:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:26:01,123 INFO L225 Difference]: With dead ends: 225 [2022-07-19 15:26:01,123 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 15:26:01,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 15:26:01,124 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 220 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 44 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:26:01,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 379 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 465 Invalid, 5 Unknown, 0 Unchecked, 11.0s Time] [2022-07-19 15:26:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 15:26:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 144. [2022-07-19 15:26:01,155 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-19 15:26:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2022-07-19 15:26:01,156 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 58 [2022-07-19 15:26:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:26:01,156 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2022-07-19 15:26:01,157 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-19 15:26:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2022-07-19 15:26:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 15:26:01,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:26:01,158 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-19 15:26:01,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 15:26:01,362 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-19 15:26:01,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:26:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:26:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1156626236, now seen corresponding path program 4 times [2022-07-19 15:26:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:26:01,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580650908] [2022-07-19 15:26:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:26:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:26:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:26:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 15:26:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:26:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:26:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:01,462 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-19 15:26:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:26:01,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580650908] [2022-07-19 15:26:01,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580650908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:26:01,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434831522] [2022-07-19 15:26:01,463 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 15:26:01,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:26:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:26:01,465 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-19 15:26:01,469 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-19 15:26:01,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 15:26:01,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:26:01,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 15:26:01,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:26:01,644 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-19 15:26:01,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:26:01,716 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-19 15:26:01,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434831522] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:26:01,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:26:01,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-07-19 15:26:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523076481] [2022-07-19 15:26:01,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:26:01,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 15:26:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:26:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 15:26:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-19 15:26:01,718 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-19 15:26:03,754 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-19 15:26:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:26:04,190 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2022-07-19 15:26:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 15:26:04,191 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-19 15:26:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:26:04,191 INFO L225 Difference]: With dead ends: 187 [2022-07-19 15:26:04,191 INFO L226 Difference]: Without dead ends: 160 [2022-07-19 15:26:04,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-07-19 15:26:04,192 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:26:04,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 288 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 15:26:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-19 15:26:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2022-07-19 15:26:04,214 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-19 15:26:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2022-07-19 15:26:04,215 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 58 [2022-07-19 15:26:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:26:04,216 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2022-07-19 15:26:04,216 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-19 15:26:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2022-07-19 15:26:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 15:26:04,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:26:04,217 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-19 15:26:04,234 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-19 15:26:04,419 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-19 15:26:04,419 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:26:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:26:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -4426440, now seen corresponding path program 5 times [2022-07-19 15:26:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:26:04,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040451443] [2022-07-19 15:26:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:26:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:26:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:26:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 15:26:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:26:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:26:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:04,543 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-19 15:26:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:26:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040451443] [2022-07-19 15:26:04,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040451443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:26:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365263213] [2022-07-19 15:26:04,543 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 15:26:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:26:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:26:04,548 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-19 15:26:04,572 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-19 15:26:04,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-19 15:26:04,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:26:04,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-19 15:26:04,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:26:05,127 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-19 15:26:05,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 15:26:05,430 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-19 15:26:05,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365263213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 15:26:05,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 15:26:05,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 21 [2022-07-19 15:26:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211279396] [2022-07-19 15:26:05,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 15:26:05,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 15:26:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:26:05,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 15:26:05,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-07-19 15:26:05,434 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-19 15:26:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:26:06,500 INFO L93 Difference]: Finished difference Result 285 states and 367 transitions. [2022-07-19 15:26:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 15:26:06,501 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-19 15:26:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:26:06,502 INFO L225 Difference]: With dead ends: 285 [2022-07-19 15:26:06,502 INFO L226 Difference]: Without dead ends: 276 [2022-07-19 15:26:06,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=622, Invalid=1828, Unknown=0, NotChecked=0, Total=2450 [2022-07-19 15:26:06,504 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 221 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 15:26:06,504 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.3s Time] [2022-07-19 15:26:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-19 15:26:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 124. [2022-07-19 15:26:06,535 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-19 15:26:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2022-07-19 15:26:06,536 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 61 [2022-07-19 15:26:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:26:06,536 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2022-07-19 15:26:06,537 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-19 15:26:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2022-07-19 15:26:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 15:26:06,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:26:06,538 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-19 15:26:06,561 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-19 15:26:06,759 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-19 15:26:06,760 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:26:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:26:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 108996138, now seen corresponding path program 6 times [2022-07-19 15:26:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:26:06,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267510306] [2022-07-19 15:26:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:26:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:26:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 15:26:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:06,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 15:26:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 15:26:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 15:26:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:26:06,939 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-19 15:26:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:26:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267510306] [2022-07-19 15:26:06,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267510306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 15:26:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378349084] [2022-07-19 15:26:06,939 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 15:26:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 15:26:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:26:06,944 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-19 15:26:06,967 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-19 15:26:07,060 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-19 15:26:07,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 15:26:07,064 WARN L261 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 151 conjunts are in the unsatisfiable core [2022-07-19 15:26:07,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 15:26:07,075 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-19 15:26:07,138 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-19 15:26:07,229 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 15:26:07,230 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-19 15:26:07,283 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-19 15:26:07,292 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-19 15:26:07,361 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-19 15:26:07,368 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-19 15:26:07,486 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-19 15:26:07,511 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-19 15:26:07,512 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-19 15:26:07,651 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-19 15:26:07,668 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-19 15:26:07,668 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-19 15:26:08,121 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-19 15:26:08,982 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-19 15:26:13,061 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-19 15:26:18,049 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-19 15:26:21,744 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-19 15:26:49,239 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-19 15:26:49,249 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-19 15:26:49,338 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-19 15:26:49,339 INFO L328 TraceCheckSpWp]: Computing backward predicates...