./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/array-fpi/ss2.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 e3a2069d11be89fa2c8e98300820eccf9d61bcc6c7ca5fd30afcaf42942b8548 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:35:56,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:35:56,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:35:56,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:35:56,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:35:56,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:35:56,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:35:56,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:35:56,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:35:56,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:35:56,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:35:56,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:35:56,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:35:56,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:35:56,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:35:56,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:35:56,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:35:56,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:35:56,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:35:56,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:35:56,751 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:35:56,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:35:56,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:35:56,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:35:56,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:35:56,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:35:56,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:35:56,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:35:56,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:35:56,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:35:56,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:35:56,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:35:56,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:35:56,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:35:56,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:35:56,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:35:56,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:35:56,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:35:56,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:35:56,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:35:56,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:35:56,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:35:56,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:35:56,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:35:56,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:35:56,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:35:56,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:35:56,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:35:56,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:35:56,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:35:56,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:35:56,799 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:35:56,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:35:56,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:35:56,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:35:56,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:35:56,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:35:56,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:35:56,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:35:56,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:35:56,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:35:56,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:35:56,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:35:56,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:35:56,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:35:56,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:35:56,803 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:35:56,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:35:56,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:35:56,804 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 -> e3a2069d11be89fa2c8e98300820eccf9d61bcc6c7ca5fd30afcaf42942b8548 [2022-07-11 23:35:56,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:35:56,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:35:56,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:35:56,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:35:56,967 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:35:56,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss2.c [2022-07-11 23:35:57,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f309a06c/040c822810f24a61a6c7daf908c760f4/FLAGd60b570f9 [2022-07-11 23:35:57,376 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:35:57,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c [2022-07-11 23:35:57,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f309a06c/040c822810f24a61a6c7daf908c760f4/FLAGd60b570f9 [2022-07-11 23:35:57,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f309a06c/040c822810f24a61a6c7daf908c760f4 [2022-07-11 23:35:57,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:35:57,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:35:57,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:35:57,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:35:57,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:35:57,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:35:57" (1/1) ... [2022-07-11 23:35:57,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0ec9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:57, skipping insertion in model container [2022-07-11 23:35:57,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:35:57" (1/1) ... [2022-07-11 23:35:57,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:35:57,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:35:57,980 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/array-fpi/ss2.c[586,599] [2022-07-11 23:35:58,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:35:58,018 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:35:58,030 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/array-fpi/ss2.c[586,599] [2022-07-11 23:35:58,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:35:58,060 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:35:58,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58 WrapperNode [2022-07-11 23:35:58,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:35:58,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:35:58,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:35:58,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:35:58,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,096 INFO L137 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-07-11 23:35:58,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:35:58,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:35:58,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:35:58,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:35:58,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:35:58,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:35:58,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:35:58,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:35:58,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (1/1) ... [2022-07-11 23:35:58,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:35:58,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:35:58,154 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-11 23:35:58,159 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-11 23:35:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:35:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:35:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:35:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:35:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:35:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:35:58,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:35:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:35:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:35:58,260 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:35:58,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:35:58,502 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:35:58,507 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:35:58,511 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-11 23:35:58,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:35:58 BoogieIcfgContainer [2022-07-11 23:35:58,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:35:58,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:35:58,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:35:58,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:35:58,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:35:57" (1/3) ... [2022-07-11 23:35:58,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702e25d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:35:58, skipping insertion in model container [2022-07-11 23:35:58,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:35:58" (2/3) ... [2022-07-11 23:35:58,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702e25d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:35:58, skipping insertion in model container [2022-07-11 23:35:58,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:35:58" (3/3) ... [2022-07-11 23:35:58,522 INFO L111 eAbstractionObserver]: Analyzing ICFG ss2.c [2022-07-11 23:35:58,533 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:35:58,533 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:35:58,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:35:58,591 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@409bea6d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@779e5bb0 [2022-07-11 23:35:58,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:35:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:35:58,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:35:58,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:35:58,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:35:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:35:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash -642180410, now seen corresponding path program 1 times [2022-07-11 23:35:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:35:58,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819570798] [2022-07-11 23:35:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:35:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:35:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:35:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:35:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:35:58,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819570798] [2022-07-11 23:35:58,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819570798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:35:58,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:35:58,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:35:58,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121587254] [2022-07-11 23:35:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:35:58,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:35:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:35:58,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:35:58,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:35:58,770 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:35:58,786 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2022-07-11 23:35:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:35:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-11 23:35:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:35:58,794 INFO L225 Difference]: With dead ends: 62 [2022-07-11 23:35:58,794 INFO L226 Difference]: Without dead ends: 29 [2022-07-11 23:35:58,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:35:58,804 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:35:58,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:35:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-11 23:35:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-11 23:35:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-11 23:35:58,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2022-07-11 23:35:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:35:58,829 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-11 23:35:58,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-11 23:35:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:35:58,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:35:58,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:35:58,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:35:58,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:35:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:35:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1011332042, now seen corresponding path program 1 times [2022-07-11 23:35:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:35:58,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082688046] [2022-07-11 23:35:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:35:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:35:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:35:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:35:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:35:58,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082688046] [2022-07-11 23:35:58,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082688046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:35:58,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:35:58,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:35:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406043234] [2022-07-11 23:35:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:35:58,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:35:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:35:58,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:35:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:35:58,951 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:35:59,041 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-07-11 23:35:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:35:59,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-11 23:35:59,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:35:59,043 INFO L225 Difference]: With dead ends: 69 [2022-07-11 23:35:59,044 INFO L226 Difference]: Without dead ends: 47 [2022-07-11 23:35:59,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:35:59,049 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:35:59,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 19 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:35:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-11 23:35:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-07-11 23:35:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-11 23:35:59,062 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2022-07-11 23:35:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:35:59,065 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-11 23:35:59,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:35:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-11 23:35:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:35:59,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:35:59,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:35:59,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:35:59,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:35:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:35:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1890076394, now seen corresponding path program 1 times [2022-07-11 23:35:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:35:59,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286116256] [2022-07-11 23:35:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:35:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:35:59,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:35:59,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184593357] [2022-07-11 23:35:59,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:35:59,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:35:59,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:35:59,125 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-11 23:35:59,147 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-11 23:35:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:35:59,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-11 23:35:59,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:35:59,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:35:59,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:35:59,370 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 23 treesize of output 22 [2022-07-11 23:35:59,480 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 23 [2022-07-11 23:35:59,554 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 26 treesize of output 21 [2022-07-11 23:35:59,623 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 23 [2022-07-11 23:35:59,673 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 23 [2022-07-11 23:35:59,755 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 38 treesize of output 25 [2022-07-11 23:35:59,873 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 57 treesize of output 37 [2022-07-11 23:35:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:35:59,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:36:01,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:01,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:36:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286116256] [2022-07-11 23:36:01,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:36:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184593357] [2022-07-11 23:36:01,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184593357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:36:01,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:36:01,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2022-07-11 23:36:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211444222] [2022-07-11 23:36:01,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:36:01,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-11 23:36:01,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:36:01,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-11 23:36:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2022-07-11 23:36:01,334 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:36:07,526 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-07-11 23:36:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-11 23:36:07,527 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-11 23:36:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:36:07,529 INFO L225 Difference]: With dead ends: 94 [2022-07-11 23:36:07,529 INFO L226 Difference]: Without dead ends: 79 [2022-07-11 23:36:07,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2022-07-11 23:36:07,530 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:36:07,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 177 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 644 Invalid, 0 Unknown, 87 Unchecked, 2.2s Time] [2022-07-11 23:36:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-11 23:36:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2022-07-11 23:36:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-07-11 23:36:07,548 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 32 [2022-07-11 23:36:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:36:07,548 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-07-11 23:36:07,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-07-11 23:36:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:36:07,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:36:07,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:36:07,570 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-11 23:36:07,751 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-11 23:36:07,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:36:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:36:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1237633832, now seen corresponding path program 2 times [2022-07-11 23:36:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:36:07,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340658801] [2022-07-11 23:36:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:36:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:36:07,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:36:07,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544967672] [2022-07-11 23:36:07,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:36:07,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:36:07,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:36:07,783 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-11 23:36:07,787 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-11 23:36:07,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:36:07,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:36:07,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:36:07,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:36:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:36:07,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:36:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:36:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:36:07,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340658801] [2022-07-11 23:36:07,923 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:36:07,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544967672] [2022-07-11 23:36:07,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544967672] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:36:07,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:36:07,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-11 23:36:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052721918] [2022-07-11 23:36:07,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:36:07,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:36:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:36:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:36:07,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:36:07,926 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:36:08,092 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2022-07-11 23:36:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:36:08,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-11 23:36:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:36:08,094 INFO L225 Difference]: With dead ends: 159 [2022-07-11 23:36:08,094 INFO L226 Difference]: Without dead ends: 90 [2022-07-11 23:36:08,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:36:08,094 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:36:08,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 53 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:36:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-11 23:36:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2022-07-11 23:36:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-07-11 23:36:08,102 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 34 [2022-07-11 23:36:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:36:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-07-11 23:36:08,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-07-11 23:36:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:36:08,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:36:08,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:36:08,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-11 23:36:08,320 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-11 23:36:08,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:36:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:36:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash -373015448, now seen corresponding path program 3 times [2022-07-11 23:36:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:36:08,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836673227] [2022-07-11 23:36:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:36:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:36:08,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:36:08,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007681011] [2022-07-11 23:36:08,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:36:08,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:36:08,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:36:08,340 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-11 23:36:08,348 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-11 23:36:08,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:36:08,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:36:08,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:36:08,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:36:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:36:08,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:36:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:36:08,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:36:08,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836673227] [2022-07-11 23:36:08,462 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:36:08,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007681011] [2022-07-11 23:36:08,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007681011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:36:08,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:36:08,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-11 23:36:08,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151337206] [2022-07-11 23:36:08,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:36:08,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:36:08,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:36:08,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:36:08,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:36:08,464 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:36:08,587 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-07-11 23:36:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:36:08,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-11 23:36:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:36:08,588 INFO L225 Difference]: With dead ends: 85 [2022-07-11 23:36:08,588 INFO L226 Difference]: Without dead ends: 64 [2022-07-11 23:36:08,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:36:08,589 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 117 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:36:08,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 40 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:36:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-11 23:36:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2022-07-11 23:36:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-07-11 23:36:08,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 34 [2022-07-11 23:36:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:36:08,594 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-07-11 23:36:08,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:36:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-07-11 23:36:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:36:08,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:36:08,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:36:08,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:36:08,805 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-11 23:36:08,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:36:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:36:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 772187038, now seen corresponding path program 4 times [2022-07-11 23:36:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:36:08,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480141108] [2022-07-11 23:36:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:36:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:36:08,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:36:08,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561441370] [2022-07-11 23:36:08,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:36:08,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:36:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:36:08,854 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-11 23:36:08,855 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-11 23:36:08,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:36:08,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:36:08,907 WARN L261 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-11 23:36:08,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:36:08,921 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 11 treesize of output 7 [2022-07-11 23:36:08,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:08,937 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 23 treesize of output 22 [2022-07-11 23:36:08,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:08,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:08,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-11 23:36:09,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:09,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-11 23:36:09,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-07-11 23:36:09,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:09,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-11 23:36:09,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-07-11 23:36:09,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:09,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-11 23:36:09,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-07-11 23:36:09,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:09,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-11 23:36:09,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2022-07-11 23:36:09,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:09,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 49 [2022-07-11 23:36:09,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:09,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:36:09,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2022-07-11 23:36:10,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:36:10,139 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 55 treesize of output 35 [2022-07-11 23:36:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:10,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:36:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:36:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:36:47,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480141108] [2022-07-11 23:36:47,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:36:47,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561441370] [2022-07-11 23:36:47,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561441370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:36:47,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:36:47,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 57 [2022-07-11 23:36:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541783330] [2022-07-11 23:36:47,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:36:47,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-11 23:36:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:36:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-11 23:36:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2932, Unknown=0, NotChecked=0, Total=3192 [2022-07-11 23:36:47,185 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 57 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:37:24,536 WARN L233 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:39:01,809 WARN L233 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:39:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:05,280 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2022-07-11 23:39:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-11 23:39:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-11 23:39:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:05,281 INFO L225 Difference]: With dead ends: 119 [2022-07-11 23:39:05,281 INFO L226 Difference]: Without dead ends: 117 [2022-07-11 23:39:05,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 165.2s TimeCoverageRelationStatistics Valid=474, Invalid=6656, Unknown=10, NotChecked=0, Total=7140 [2022-07-11 23:39:05,285 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:05,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 209 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1102 Invalid, 0 Unknown, 330 Unchecked, 9.5s Time] [2022-07-11 23:39:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-11 23:39:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2022-07-11 23:39:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.168421052631579) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-07-11 23:39:05,299 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 44 [2022-07-11 23:39:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:05,299 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-07-11 23:39:05,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-07-11 23:39:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:39:05,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:05,300 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-11 23:39:05,320 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-11 23:39:05,507 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-11 23:39:05,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 687786716, now seen corresponding path program 5 times [2022-07-11 23:39:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:39:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345633836] [2022-07-11 23:39:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:39:05,547 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:39:05,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120866490] [2022-07-11 23:39:05,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:39:05,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:39:05,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:39:05,561 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-11 23:39:05,572 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-11 23:39:05,730 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:39:05,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:39:05,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:39:05,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:39:05,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:39:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:39:05,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345633836] [2022-07-11 23:39:05,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:39:05,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120866490] [2022-07-11 23:39:05,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120866490] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:05,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:39:05,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-11 23:39:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887098194] [2022-07-11 23:39:05,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:05,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:39:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:39:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:39:05,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:39:05,829 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:06,045 INFO L93 Difference]: Finished difference Result 221 states and 253 transitions. [2022-07-11 23:39:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:39:06,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-11 23:39:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:06,046 INFO L225 Difference]: With dead ends: 221 [2022-07-11 23:39:06,046 INFO L226 Difference]: Without dead ends: 160 [2022-07-11 23:39:06,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:39:06,047 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 171 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:06,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 61 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:39:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-11 23:39:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2022-07-11 23:39:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.1206896551724137) internal successors, (130), 116 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2022-07-11 23:39:06,073 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 46 [2022-07-11 23:39:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:06,074 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2022-07-11 23:39:06,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2022-07-11 23:39:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:39:06,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:06,075 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 23:39:06,109 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-11 23:39:06,310 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-11 23:39:06,310 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -977955692, now seen corresponding path program 1 times [2022-07-11 23:39:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:39:06,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269468641] [2022-07-11 23:39:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:39:06,328 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:39:06,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512239127] [2022-07-11 23:39:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:39:06,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:39:06,330 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-11 23:39:06,371 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-11 23:39:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:06,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-11 23:39:06,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:06,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:39:06,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:39:06,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:39:06,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-11 23:39:06,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:39:06,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:39:06,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-07-11 23:39:06,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:39:06,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2022-07-11 23:39:06,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2022-07-11 23:39:06,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-11 23:39:06,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:39:06,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-07-11 23:39:06,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:39:06,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:39:06,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-07-11 23:39:06,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:39:06,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-07-11 23:39:06,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:39:06,926 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 1 case distinctions, treesize of input 57 treesize of output 37 [2022-07-11 23:39:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:39:06,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:08,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:39:08,841 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 73 [2022-07-11 23:39:08,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (* 2 ~N~0)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (* ~N~0 ~N~0))) (or (let ((.cse2 (+ .cse3 .cse4))) (= (+ (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2)) (not (= (+ .cse3 (* (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4) (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) is different from false [2022-07-11 23:39:08,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 .cse6))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (* 2 ~N~0)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (* ~N~0 ~N~0))) (or (let ((.cse2 (+ .cse3 .cse4))) (= (+ (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) .cse2)) (not (= (+ .cse3 (* (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4) (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) is different from false [2022-07-11 23:39:08,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (~N~0 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 .cse6))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (* 2 ~N~0)) (.cse2 (* ~N~0 ~N~0))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ .cse0 (* (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2))) (let ((.cse4 (+ .cse0 .cse2))) (= (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) .cse4)))))) is different from false [2022-07-11 23:39:09,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (+ .cse9 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (let ((.cse8 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse5 .cse6 (+ (select .cse7 .cse6) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (* 2 ~N~0)) (.cse4 (* ~N~0 ~N~0)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (let ((.cse0 (+ .cse3 .cse4))) (= .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (= (+ .cse3 .cse4 (* (- 1) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))))) is different from false [2022-07-11 23:39:09,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse6 .cse3 (+ (select .cse7 .cse3) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (* 2 ~N~0)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (* ~N~0 ~N~0))) (or (let ((.cse2 (+ .cse4 .cse5))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse3)) .cse2)) (not (= (+ .cse4 (* (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) is different from false [2022-07-11 23:39:09,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse6 .cse2 (+ (select .cse7 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (* 2 ~N~0)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (* ~N~0 ~N~0))) (or (let ((.cse0 (+ .cse4 .cse5))) (= .cse0 (+ (select .cse1 .cse2) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (= (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (+ .cse4 (* (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5)))))))) is different from false [2022-07-11 23:39:09,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse6 .cse2 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse2)))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse4 (* 2 ~N~0)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (* ~N~0 ~N~0))) (or (let ((.cse0 (+ .cse4 .cse5))) (= .cse0 (+ (select .cse1 .cse2) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (= (+ .cse4 (* (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))))) is different from false [2022-07-11 23:39:13,183 INFO L356 Elim1Store]: treesize reduction 530, result has 47.1 percent of original size [2022-07-11 23:39:13,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 14148 treesize of output 4337 [2022-07-11 23:39:13,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 5 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 5256 treesize of output 5056 [2022-07-11 23:39:13,963 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-11 23:39:13,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 8865 treesize of output 8775 [2022-07-11 23:39:14,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:39:14,054 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 10787 treesize of output 10767 [2022-07-11 23:39:14,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:39:14,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:39:14,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 11688 treesize of output 10938