./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:09:31,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:09:31,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:09:31,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:09:31,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:09:31,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:09:31,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:09:31,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:09:31,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:09:31,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:09:31,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:09:31,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:09:31,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:09:31,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:09:31,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:09:31,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:09:31,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:09:31,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:09:31,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:09:31,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:09:31,848 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:09:31,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:09:31,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:09:31,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:09:31,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:09:31,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:09:31,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:09:31,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:09:31,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:09:31,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:09:31,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:09:31,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:09:31,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:09:31,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:09:31,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:09:31,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:09:31,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:09:31,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:09:31,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:09:31,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:09:31,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:09:31,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:09:31,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:09:31,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:09:31,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:09:31,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:09:31,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:09:31,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:09:31,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:09:31,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:09:31,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:09:31,895 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:09:31,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:09:31,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:09:31,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:09:31,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:09:31,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:09:31,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:09:31,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:09:31,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:09:31,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:09:31,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:09:31,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:09:31,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:09:31,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:09:31,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:09:31,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:09:31,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:31,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:09:31,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:09:31,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:09:31,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:09:31,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:09:31,900 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:09:31,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:09:31,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:09:31,900 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2022-07-13 18:09:32,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:09:32,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:09:32,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:09:32,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:09:32,097 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:09:32,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-13 18:09:32,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4581ecc0a/0faa21e107164aa48e90cb8124ec8d3e/FLAGd3e6d839a [2022-07-13 18:09:32,516 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:09:32,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-13 18:09:32,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4581ecc0a/0faa21e107164aa48e90cb8124ec8d3e/FLAGd3e6d839a [2022-07-13 18:09:32,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4581ecc0a/0faa21e107164aa48e90cb8124ec8d3e [2022-07-13 18:09:32,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:09:32,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:09:32,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:32,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:09:32,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:09:32,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f532d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32, skipping insertion in model container [2022-07-13 18:09:32,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:09:32,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:09:32,716 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_rec.c[525,538] [2022-07-13 18:09:32,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:32,766 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:09:32,776 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_rec.c[525,538] [2022-07-13 18:09:32,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:32,811 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:09:32,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32 WrapperNode [2022-07-13 18:09:32,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:32,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:32,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:09:32,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:09:32,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,858 INFO L137 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-07-13 18:09:32,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:32,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:09:32,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:09:32,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:09:32,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:09:32,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:09:32,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:09:32,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:09:32,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (1/1) ... [2022-07-13 18:09:32,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:32,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:09:32,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:09:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:09:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 18:09:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 18:09:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:09:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-07-13 18:09:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-07-13 18:09:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 18:09:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 18:09:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-07-13 18:09:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-07-13 18:09:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:09:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:09:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 18:09:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-13 18:09:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-13 18:09:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 18:09:33,042 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:09:33,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:09:35,343 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:09:35,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:09:35,348 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 18:09:35,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:35 BoogieIcfgContainer [2022-07-13 18:09:35,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:09:35,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:09:35,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:09:35,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:09:35,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:09:32" (1/3) ... [2022-07-13 18:09:35,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5547db7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:35, skipping insertion in model container [2022-07-13 18:09:35,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:32" (2/3) ... [2022-07-13 18:09:35,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5547db7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:35, skipping insertion in model container [2022-07-13 18:09:35,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:35" (3/3) ... [2022-07-13 18:09:35,357 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-07-13 18:09:35,369 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:09:35,370 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:09:35,408 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:09:35,412 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@373a5a90, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e82f607 [2022-07-13 18:09:35,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:09:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 18:09:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:09:35,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:35,423 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, 1, 1, 1, 1, 1] [2022-07-13 18:09:35,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:35,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2022-07-13 18:09:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:35,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251387868] [2022-07-13 18:09:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:09:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:09:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 18:09:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 18:09:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:09:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:35,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251387868] [2022-07-13 18:09:35,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251387868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:35,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:35,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:09:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770897663] [2022-07-13 18:09:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:35,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:09:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:09:35,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:09:35,700 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:09:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:35,794 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-07-13 18:09:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:09:35,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-13 18:09:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:35,802 INFO L225 Difference]: With dead ends: 96 [2022-07-13 18:09:35,803 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 18:09:35,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:09:35,809 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:35,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:09:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 18:09:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-13 18:09:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 18:09:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-07-13 18:09:35,842 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2022-07-13 18:09:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:35,843 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-07-13 18:09:35,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:09:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-07-13 18:09:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:09:35,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:35,846 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, 1, 1, 1, 1, 1] [2022-07-13 18:09:35,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:09:35,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:35,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2022-07-13 18:09:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:35,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958189878] [2022-07-13 18:09:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:09:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:09:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 18:09:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 18:09:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:09:36,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:36,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958189878] [2022-07-13 18:09:36,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958189878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:36,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:36,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:09:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145250479] [2022-07-13 18:09:36,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:36,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:09:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:36,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:09:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:09:36,006 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:09:38,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 18:09:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:38,368 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-07-13 18:09:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:09:38,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-13 18:09:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:38,370 INFO L225 Difference]: With dead ends: 87 [2022-07-13 18:09:38,370 INFO L226 Difference]: Without dead ends: 71 [2022-07-13 18:09:38,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:09:38,371 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:38,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 213 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 18:09:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-13 18:09:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-07-13 18:09:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 18:09:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-13 18:09:38,378 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2022-07-13 18:09:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:38,378 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-13 18:09:38,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:09:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-07-13 18:09:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 18:09:38,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:38,380 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:09:38,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:09:38,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2022-07-13 18:09:38,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:38,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515630121] [2022-07-13 18:09:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:38,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:09:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:09:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 18:09:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:09:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:09:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515630121] [2022-07-13 18:09:38,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515630121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:38,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934154063] [2022-07-13 18:09:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:38,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:38,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:38,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:09:38,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:09:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:38,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 18:09:38,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:09:38,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:09:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:09:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934154063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:09:38,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:09:38,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-13 18:09:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956727807] [2022-07-13 18:09:38,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:09:38,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 18:09:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:38,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 18:09:38,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:09:38,937 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 18:09:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:39,148 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-07-13 18:09:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:09:39,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46 [2022-07-13 18:09:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:39,150 INFO L225 Difference]: With dead ends: 73 [2022-07-13 18:09:39,150 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 18:09:39,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:09:39,151 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:39,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:09:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 18:09:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-13 18:09:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 18:09:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-13 18:09:39,156 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2022-07-13 18:09:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:39,156 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-13 18:09:39,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 18:09:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-13 18:09:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 18:09:39,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:39,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:09:39,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:09:39,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:39,358 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2022-07-13 18:09:39,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:39,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025438344] [2022-07-13 18:09:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:09:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:09:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 18:09:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 18:09:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:09:39,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:39,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025438344] [2022-07-13 18:09:39,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025438344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:39,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195777258] [2022-07-13 18:09:39,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:09:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:39,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:39,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:09:39,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:09:39,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:09:39,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:09:39,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 18:09:39,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:39,708 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 16 treesize of output 12 [2022-07-13 18:09:40,794 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-13 18:09:40,795 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 2 case distinctions, treesize of input 45 treesize of output 27 [2022-07-13 18:09:40,980 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-13 18:09:40,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 23 [2022-07-13 18:09:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:09:41,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:09:41,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195777258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:41,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:09:41,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2022-07-13 18:09:41,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112064376] [2022-07-13 18:09:41,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:09:41,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 18:09:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 18:09:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-07-13 18:09:41,288 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 18:09:43,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 18:09:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:44,289 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-07-13 18:09:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 18:09:44,289 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2022-07-13 18:09:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:44,291 INFO L225 Difference]: With dead ends: 99 [2022-07-13 18:09:44,291 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 18:09:44,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 18:09:44,292 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 38 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:44,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 377 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 363 Invalid, 1 Unknown, 149 Unchecked, 2.5s Time] [2022-07-13 18:09:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 18:09:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-07-13 18:09:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-13 18:09:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-07-13 18:09:44,301 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 48 [2022-07-13 18:09:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:44,301 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-07-13 18:09:44,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 18:09:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-07-13 18:09:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 18:09:44,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:44,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:09:44,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:09:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 18:09:44,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1879560803, now seen corresponding path program 1 times [2022-07-13 18:09:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:44,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290231495] [2022-07-13 18:09:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:09:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 18:09:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:09:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 18:09:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:09:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 18:09:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:46,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290231495] [2022-07-13 18:09:46,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290231495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:46,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482545574] [2022-07-13 18:09:46,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:46,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:46,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:46,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:09:46,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:09:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:46,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-13 18:09:46,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:46,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:09:46,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 18:09:46,481 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 18:09:46,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 18:09:46,554 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 15 treesize of output 10 [2022-07-13 18:09:46,645 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 36 treesize of output 32 [2022-07-13 18:09:46,737 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 28 treesize of output 26 [2022-07-13 18:09:51,189 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 51 treesize of output 45 [2022-07-13 18:09:53,312 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 34 treesize of output 32 [2022-07-13 18:09:54,654 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_181 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_181))) |c_#memory_int|)) is different from true [2022-07-13 18:09:54,678 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 66 treesize of output 60 [2022-07-13 18:10:00,984 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 92 treesize of output 80 [2022-07-13 18:10:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:10:01,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:13,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_check_~a0#1.offset_6| Int)) (or (let ((.cse0 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse1 (= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0))) (and (or (and .cse0 (not .cse1)) (forall ((v_ArrVal_188 Int)) (let ((.cse2 (let ((.cse5 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse5) (select .cse3 .cse4)))) .cse5 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (or (not .cse0) (forall ((v_ArrVal_188 Int)) (let ((.cse6 (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse9) (select .cse7 .cse8)))) .cse9 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) .cse1))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_6|))) is different from false [2022-07-13 18:10:13,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482545574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:13,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:10:13,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-07-13 18:10:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373656899] [2022-07-13 18:10:13,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:13,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-13 18:10:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-13 18:10:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2006, Unknown=12, NotChecked=182, Total=2352 [2022-07-13 18:10:13,634 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-13 18:10:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:44,061 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-07-13 18:10:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 18:10:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-07-13 18:10:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:44,064 INFO L225 Difference]: With dead ends: 91 [2022-07-13 18:10:44,064 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 18:10:44,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=327, Invalid=3688, Unknown=25, NotChecked=250, Total=4290 [2022-07-13 18:10:44,066 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:44,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 491 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 478 Invalid, 0 Unknown, 259 Unchecked, 0.5s Time] [2022-07-13 18:10:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 18:10:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-07-13 18:10:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-13 18:10:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-07-13 18:10:44,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 53 [2022-07-13 18:10:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:44,077 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-07-13 18:10:44,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-13 18:10:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-07-13 18:10:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 18:10:44,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:44,078 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] [2022-07-13 18:10:44,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 18:10:44,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:44,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 1 times [2022-07-13 18:10:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:44,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111918459] [2022-07-13 18:10:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:10:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:10:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:10:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 18:10:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 18:10:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:10:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111918459] [2022-07-13 18:10:44,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111918459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550589129] [2022-07-13 18:10:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:44,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:44,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:44,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:10:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:44,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 18:10:44,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:10:44,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:10:44,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550589129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:44,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:44,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-07-13 18:10:44,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423585547] [2022-07-13 18:10:44,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:44,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 18:10:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 18:10:44,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:10:44,700 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:10:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:44,924 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2022-07-13 18:10:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 18:10:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 54 [2022-07-13 18:10:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:44,925 INFO L225 Difference]: With dead ends: 115 [2022-07-13 18:10:44,925 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 18:10:44,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:10:44,926 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:44,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 243 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:10:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 18:10:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-07-13 18:10:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-13 18:10:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2022-07-13 18:10:44,936 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 54 [2022-07-13 18:10:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:44,937 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2022-07-13 18:10:44,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:10:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2022-07-13 18:10:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 18:10:44,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:44,938 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] [2022-07-13 18:10:44,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:45,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:45,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:45,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 2 times [2022-07-13 18:10:45,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:45,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19774196] [2022-07-13 18:10:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:10:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 18:10:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:10:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 18:10:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:10:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:10:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:45,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19774196] [2022-07-13 18:10:45,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19774196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:45,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119892322] [2022-07-13 18:10:45,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:10:45,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:45,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:45,280 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:45,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:10:45,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:10:45,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:10:45,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:10:45,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:10:45,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:10:45,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119892322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:45,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:45,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-07-13 18:10:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652071749] [2022-07-13 18:10:45,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 18:10:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:45,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 18:10:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:10:45,558 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:10:47,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 18:10:49,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 18:10:51,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 18:10:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:52,309 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2022-07-13 18:10:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 18:10:52,309 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-07-13 18:10:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:52,310 INFO L225 Difference]: With dead ends: 127 [2022-07-13 18:10:52,310 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 18:10:52,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-07-13 18:10:52,311 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:52,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 421 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 333 Invalid, 3 Unknown, 0 Unchecked, 6.7s Time] [2022-07-13 18:10:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 18:10:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-13 18:10:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-13 18:10:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-07-13 18:10:52,322 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 57 [2022-07-13 18:10:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:52,322 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-07-13 18:10:52,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:10:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-07-13 18:10:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 18:10:52,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:52,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:10:52,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:52,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:52,541 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash 33191180, now seen corresponding path program 1 times [2022-07-13 18:10:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:52,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103651478] [2022-07-13 18:10:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:10:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 18:10:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:10:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 18:10:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:10:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:10:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:10:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:52,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103651478] [2022-07-13 18:10:52,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103651478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565671923] [2022-07-13 18:10:52,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:52,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:52,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:10:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:52,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 18:10:52,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:10:52,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 18:10:53,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565671923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:53,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:53,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-07-13 18:10:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489944189] [2022-07-13 18:10:53,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:53,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 18:10:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 18:10:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-13 18:10:53,438 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-13 18:10:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:54,007 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-07-13 18:10:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:10:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 59 [2022-07-13 18:10:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:54,008 INFO L225 Difference]: With dead ends: 106 [2022-07-13 18:10:54,008 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 18:10:54,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-07-13 18:10:54,009 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 84 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:54,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:10:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 18:10:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-13 18:10:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.121212121212121) internal successors, (74), 67 states have internal predecessors, (74), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-13 18:10:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-13 18:10:54,019 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 59 [2022-07-13 18:10:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:54,019 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-13 18:10:54,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-13 18:10:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-13 18:10:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 18:10:54,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:54,021 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, 1, 1, 1, 1] [2022-07-13 18:10:54,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:54,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:54,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:54,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1099509749, now seen corresponding path program 1 times [2022-07-13 18:10:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:54,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142118561] [2022-07-13 18:10:54,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:54,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:10:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 18:10:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:10:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 18:10:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 18:10:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 18:10:54,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:54,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142118561] [2022-07-13 18:10:54,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142118561] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:54,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595464407] [2022-07-13 18:10:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:54,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:54,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:54,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 18:10:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 18:10:54,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 18:10:54,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 18:10:55,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595464407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:55,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:55,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-07-13 18:10:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183677843] [2022-07-13 18:10:55,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:55,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 18:10:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 18:10:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-13 18:10:55,037 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 18:10:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:55,233 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-07-13 18:10:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:10:55,234 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 65 [2022-07-13 18:10:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:55,234 INFO L225 Difference]: With dead ends: 103 [2022-07-13 18:10:55,235 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 18:10:55,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-13 18:10:55,236 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:55,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 202 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:10:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 18:10:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-07-13 18:10:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-13 18:10:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-07-13 18:10:55,243 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 65 [2022-07-13 18:10:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:55,244 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-07-13 18:10:55,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 18:10:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-07-13 18:10:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 18:10:55,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:55,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2022-07-13 18:10:55,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:55,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:55,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash -838921823, now seen corresponding path program 1 times [2022-07-13 18:10:55,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:55,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265602847] [2022-07-13 18:10:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:10:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:10:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:10:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 18:10:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 18:10:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 18:10:55,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:55,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265602847] [2022-07-13 18:10:55,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265602847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775703531] [2022-07-13 18:10:55,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:55,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:55,599 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:55,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 18:10:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:55,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 18:10:55,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 18:10:55,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 18:10:55,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775703531] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:55,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:55,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-07-13 18:10:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056970175] [2022-07-13 18:10:55,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 18:10:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 18:10:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:10:55,870 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 18:10:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:56,042 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-13 18:10:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:10:56,042 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-13 18:10:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:56,043 INFO L225 Difference]: With dead ends: 67 [2022-07-13 18:10:56,043 INFO L226 Difference]: Without dead ends: 58 [2022-07-13 18:10:56,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:10:56,044 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:56,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:10:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-13 18:10:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-13 18:10:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-13 18:10:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-07-13 18:10:56,049 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 66 [2022-07-13 18:10:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:56,049 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-07-13 18:10:56,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 18:10:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-07-13 18:10:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:10:56,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:56,051 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2022-07-13 18:10:56,069 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-13 18:10:56,255 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,SelfDestructingSolverStorable9 [2022-07-13 18:10:56,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2022-07-13 18:10:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144021322] [2022-07-13 18:10:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:10:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:10:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:10:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 18:10:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 18:10:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:10:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 18:10:56,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:56,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144021322] [2022-07-13 18:10:56,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144021322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:56,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500931737] [2022-07-13 18:10:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:56,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:56,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:56,504 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:56,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 18:10:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:56,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-13 18:10:56,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:56,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:10:56,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 18:10:56,728 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 18:10:56,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 18:10:56,758 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_545 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_545) |c_#memory_int|)) is different from true [2022-07-13 18:10:56,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:10:56,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:10:56,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:10:56,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:11:01,423 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_552 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_552)))) is different from true [2022-07-13 18:11:12,329 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 37 treesize of output 32 [2022-07-13 18:11:12,461 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 45 treesize of output 40 [2022-07-13 18:11:17,857 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2022-07-13 18:11:23,409 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2022-07-13 18:11:29,925 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 154 treesize of output 143 [2022-07-13 18:11:39,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2022-07-13 18:11:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 15 not checked. [2022-07-13 18:11:39,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:11:46,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500931737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:46,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:11:46,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 36] total 47 [2022-07-13 18:11:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646213639] [2022-07-13 18:11:46,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:11:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-13 18:11:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:11:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-13 18:11:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1925, Unknown=21, NotChecked=364, Total=2450 [2022-07-13 18:11:46,613 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-13 18:12:02,714 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 18:12:04,721 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|)))) is different from true [2022-07-13 18:12:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:04,747 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2022-07-13 18:12:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-13 18:12:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 72 [2022-07-13 18:12:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:04,748 INFO L225 Difference]: With dead ends: 125 [2022-07-13 18:12:04,749 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 18:12:04,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=395, Invalid=5147, Unknown=28, NotChecked=750, Total=6320 [2022-07-13 18:12:04,750 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1035 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:04,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 483 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 848 Invalid, 0 Unknown, 1035 Unchecked, 0.7s Time] [2022-07-13 18:12:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 18:12:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-07-13 18:12:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 17 states have call successors, (17), 5 states have call predecessors, (17), 9 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2022-07-13 18:12:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2022-07-13 18:12:04,760 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2022-07-13 18:12:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:04,760 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2022-07-13 18:12:04,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-13 18:12:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-07-13 18:12:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 18:12:04,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:04,762 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1] [2022-07-13 18:12:04,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:04,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:04,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2022-07-13 18:12:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:04,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517199101] [2022-07-13 18:12:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:12:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:12:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 18:12:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 18:12:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:12:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 18:12:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:05,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517199101] [2022-07-13 18:12:05,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517199101] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:05,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790381511] [2022-07-13 18:12:05,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:12:05,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:05,236 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:05,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 18:12:05,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:12:05,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:12:05,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 172 conjunts are in the unsatisfiable core [2022-07-13 18:12:05,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:05,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:12:05,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 18:12:05,474 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 18:12:05,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 18:12:05,502 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_683 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_683) |c_#memory_int|)) is different from true [2022-07-13 18:12:05,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:12:05,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:12:05,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:12:05,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:12:05,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 18:12:06,511 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|)) is different from true [2022-07-13 18:12:09,595 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) is different from true [2022-07-13 18:12:15,259 WARN L855 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_693 Int) (v_ArrVal_688 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* 4 |c_upsweep_#in~left|)) v_ArrVal_688) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_693)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right))) is different from true [2022-07-13 18:12:15,279 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 32 treesize of output 27 [2022-07-13 18:12:17,784 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 40 treesize of output 35 [2022-07-13 18:12:24,908 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|)) is different from true [2022-07-13 18:12:28,658 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) is different from true [2022-07-13 18:12:30,813 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_697 Int) (v_downsweep_~left_61 Int) (downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (and (let ((.cse0 (div (+ |c_downsweep_#in~right| (* (- 1) |c_downsweep_#in~left|)) 2))) (or (and (< |c_downsweep_#in~right| |c_downsweep_#in~left|) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left 1)) (not (= (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2) 0))) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)))) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (let ((.cse1 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store (store (store .cse1 .cse2 v_ArrVal_697) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* 4 v_downsweep_~left_61)) (select .cse1 .cse2))) .cse2 v_ArrVal_704)) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703)) |c_#memory_int|))) is different from true [2022-07-13 18:12:30,888 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 89 treesize of output 82 [2022-07-13 18:12:42,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2022-07-13 18:12:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 17 not checked. [2022-07-13 18:12:42,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:44,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790381511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:44,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:12:44,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 41 [2022-07-13 18:12:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865487271] [2022-07-13 18:12:44,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:44,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 18:12:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 18:12:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1223, Unknown=22, NotChecked=532, Total=1892 [2022-07-13 18:12:44,308 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-13 18:12:46,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 18:12:59,078 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|))) is different from true [2022-07-13 18:13:09,026 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|))) is different from true [2022-07-13 18:13:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:09,050 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2022-07-13 18:13:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 18:13:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) Word has length 74 [2022-07-13 18:13:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:09,052 INFO L225 Difference]: With dead ends: 137 [2022-07-13 18:13:09,052 INFO L226 Difference]: Without dead ends: 102 [2022-07-13 18:13:09,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 59.7s TimeCoverageRelationStatistics Valid=461, Invalid=4099, Unknown=32, NotChecked=1260, Total=5852 [2022-07-13 18:13:09,053 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1238 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:09,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 385 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 551 Invalid, 1 Unknown, 1238 Unchecked, 2.5s Time] [2022-07-13 18:13:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-13 18:13:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-07-13 18:13:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2022-07-13 18:13:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2022-07-13 18:13:09,066 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 74 [2022-07-13 18:13:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:09,066 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2022-07-13 18:13:09,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-13 18:13:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2022-07-13 18:13:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 18:13:09,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:09,069 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 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] [2022-07-13 18:13:09,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 18:13:09,277 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,SelfDestructingSolverStorable11 [2022-07-13 18:13:09,278 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 844735882, now seen corresponding path program 1 times [2022-07-13 18:13:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:09,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517662650] [2022-07-13 18:13:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:13:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 18:13:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:13:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 18:13:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:13:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:13:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 18:13:09,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:09,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517662650] [2022-07-13 18:13:09,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517662650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:09,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205619132] [2022-07-13 18:13:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:09,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:09,566 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:09,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 18:13:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:09,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 18:13:09,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 18:13:09,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:13:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 18:13:10,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205619132] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:13:10,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:13:10,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 12] total 33 [2022-07-13 18:13:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630670695] [2022-07-13 18:13:10,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:13:10,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 18:13:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 18:13:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 18:13:10,823 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-13 18:13:12,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 18:13:15,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 18:13:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:16,176 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2022-07-13 18:13:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 18:13:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) Word has length 85 [2022-07-13 18:13:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:16,177 INFO L225 Difference]: With dead ends: 157 [2022-07-13 18:13:16,177 INFO L226 Difference]: Without dead ends: 116 [2022-07-13 18:13:16,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=2436, Unknown=0, NotChecked=0, Total=2756 [2022-07-13 18:13:16,179 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 101 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:16,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 988 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 18:13:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-13 18:13:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2022-07-13 18:13:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 16 states have call successors, (16), 6 states have call predecessors, (16), 9 states have return successors, (29), 19 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-13 18:13:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2022-07-13 18:13:16,193 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 85 [2022-07-13 18:13:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:16,194 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2022-07-13 18:13:16,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-13 18:13:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2022-07-13 18:13:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 18:13:16,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:16,195 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:16,212 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-13 18:13:16,404 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,SelfDestructingSolverStorable12 [2022-07-13 18:13:16,404 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:16,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1782863912, now seen corresponding path program 2 times [2022-07-13 18:13:16,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:16,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971991019] [2022-07-13 18:13:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:13:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 18:13:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:13:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:13:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 18:13:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:13:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:13:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:13:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-13 18:13:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:16,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971991019] [2022-07-13 18:13:16,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971991019] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:16,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926506374] [2022-07-13 18:13:16,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:13:16,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:16,551 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:16,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 18:13:16,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:13:16,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:13:16,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:13:16,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-13 18:13:16,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:13:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-13 18:13:17,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926506374] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:13:17,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:13:17,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-07-13 18:13:17,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825340610] [2022-07-13 18:13:17,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:13:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 18:13:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 18:13:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:13:17,194 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:13:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:17,390 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-07-13 18:13:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 18:13:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-07-13 18:13:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:17,391 INFO L225 Difference]: With dead ends: 116 [2022-07-13 18:13:17,391 INFO L226 Difference]: Without dead ends: 98 [2022-07-13 18:13:17,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:13:17,392 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:17,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 381 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:13:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-13 18:13:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-13 18:13:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1) internal successors, (77), 69 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (27), 19 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-13 18:13:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-07-13 18:13:17,403 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 97 [2022-07-13 18:13:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:17,403 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-07-13 18:13:17,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:13:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-07-13 18:13:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 18:13:17,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:17,404 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 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] [2022-07-13 18:13:17,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 18:13:17,622 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,SelfDestructingSolverStorable13 [2022-07-13 18:13:17,623 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1157064136, now seen corresponding path program 3 times [2022-07-13 18:13:17,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:17,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523977401] [2022-07-13 18:13:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:13:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 18:13:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:13:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:13:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 18:13:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:13:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:13:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 18:13:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:17,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523977401] [2022-07-13 18:13:17,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523977401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:17,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919315579] [2022-07-13 18:13:17,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:13:17,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:17,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:17,784 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:17,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 18:13:18,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 18:13:18,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:13:18,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-13 18:13:18,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:31,046 WARN L833 $PredicateComparison]: unable to prove that (and (= (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) |c_ULTIMATE.start_is_pow2_~x#1|) (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false [2022-07-13 18:13:52,688 WARN L833 $PredicateComparison]: unable to prove that (and (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse0 (= (mod (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) 4294967296) 1))) (or (and (= |c_ULTIMATE.start_is_pow2_#res#1| 0) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start_is_pow2_#res#1| 1)))) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false