./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array14_pattern.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-patterns/array14_pattern.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 fb5421f37e280df661091852c6c5794976668e422c171ea258e23204ca1fbb05 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:22:52,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:22:52,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:22:52,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:22:52,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:22:52,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:22:52,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:22:52,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:22:52,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:22:52,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:22:52,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:22:52,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:22:52,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:22:52,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:22:52,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:22:52,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:22:52,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:22:52,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:22:52,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:22:52,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:22:52,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:22:52,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:22:52,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:22:52,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:22:52,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:22:52,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:22:52,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:22:52,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:22:52,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:22:52,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:22:52,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:22:52,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:22:52,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:22:52,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:22:52,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:22:52,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:22:52,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:22:52,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:22:52,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:22:52,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:22:52,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:22:52,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:22:52,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:22:52,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:22:52,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:22:52,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:22:52,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:22:52,187 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:22:52,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:22:52,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:22:52,188 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:22:52,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:22:52,189 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:22:52,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:22:52,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:22:52,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:22:52,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:22:52,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:22:52,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:22:52,190 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:22:52,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:22:52,191 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:22:52,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:22:52,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:22:52,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:22:52,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:22:52,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:52,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:22:52,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:22:52,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:22:52,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:22:52,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:22:52,194 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:22:52,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:22:52,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:22:52,195 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 -> fb5421f37e280df661091852c6c5794976668e422c171ea258e23204ca1fbb05 [2022-02-20 14:22:52,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:22:52,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:22:52,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:22:52,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:22:52,422 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:22:52,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array14_pattern.c [2022-02-20 14:22:52,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a5a6695/98a8c867003b4026835dba1a375cdd59/FLAGe7ee19eab [2022-02-20 14:22:52,858 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:22:52,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array14_pattern.c [2022-02-20 14:22:52,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a5a6695/98a8c867003b4026835dba1a375cdd59/FLAGe7ee19eab [2022-02-20 14:22:52,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a5a6695/98a8c867003b4026835dba1a375cdd59 [2022-02-20 14:22:52,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:22:52,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:22:52,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:52,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:22:52,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:22:52,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:52" (1/1) ... [2022-02-20 14:22:52,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@963d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:52, skipping insertion in model container [2022-02-20 14:22:52,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:22:52" (1/1) ... [2022-02-20 14:22:52,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:22:52,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:22:53,099 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-patterns/array14_pattern.c[1285,1298] [2022-02-20 14:22:53,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:53,127 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:22:53,137 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-patterns/array14_pattern.c[1285,1298] [2022-02-20 14:22:53,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:22:53,160 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:22:53,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53 WrapperNode [2022-02-20 14:22:53,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:22:53,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:53,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:22:53,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:22:53,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,198 INFO L137 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2022-02-20 14:22:53,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:22:53,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:22:53,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:22:53,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:22:53,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:22:53,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:22:53,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:22:53,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:22:53,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (1/1) ... [2022-02-20 14:22:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:22:53,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:53,285 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-02-20 14:22:53,301 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-02-20 14:22:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:22:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:22:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:22:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:22:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:22:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:22:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:22:53,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:22:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:22:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:22:53,389 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:22:53,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:22:53,664 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:22:53,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:22:53,671 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:22:53,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:53 BoogieIcfgContainer [2022-02-20 14:22:53,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:22:53,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:22:53,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:22:53,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:22:53,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:22:52" (1/3) ... [2022-02-20 14:22:53,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2fd70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:53, skipping insertion in model container [2022-02-20 14:22:53,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:22:53" (2/3) ... [2022-02-20 14:22:53,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f2fd70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:22:53, skipping insertion in model container [2022-02-20 14:22:53,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:22:53" (3/3) ... [2022-02-20 14:22:53,680 INFO L111 eAbstractionObserver]: Analyzing ICFG array14_pattern.c [2022-02-20 14:22:53,684 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:22:53,685 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:22:53,719 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:22:53,725 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:22:53,725 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:22:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:22:53,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:53,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:53,748 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -152131175, now seen corresponding path program 1 times [2022-02-20 14:22:53,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:53,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374373728] [2022-02-20 14:22:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:22:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:53,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-02-20 14:22:53,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-02-20 14:22:53,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 14:22:53,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #104#return; {35#false} is VALID [2022-02-20 14:22:53,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {34#true} is VALID [2022-02-20 14:22:53,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {34#true} is VALID [2022-02-20 14:22:53,936 INFO L272 TraceCheckUtils]: 2: Hoare triple {34#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {34#true} is VALID [2022-02-20 14:22:53,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-02-20 14:22:53,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-02-20 14:22:53,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 14:22:53,939 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {35#false} {34#true} #104#return; {35#false} is VALID [2022-02-20 14:22:53,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {35#false} is VALID [2022-02-20 14:22:53,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {35#false} is VALID [2022-02-20 14:22:53,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume false; {35#false} is VALID [2022-02-20 14:22:53,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} main_~row~0#1 := 0; {35#false} is VALID [2022-02-20 14:22:53,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {35#false} is VALID [2022-02-20 14:22:53,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {35#false} is VALID [2022-02-20 14:22:53,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#false} assume 0 == __VERIFIER_assert_~cond#1; {35#false} is VALID [2022-02-20 14:22:53,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-02-20 14:22:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:22:53,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:53,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374373728] [2022-02-20 14:22:53,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374373728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:53,946 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:53,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:22:53,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158201903] [2022-02-20 14:22:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:53,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:53,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:53,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:53,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:53,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:22:53,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:22:54,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:22:54,025 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:54,095 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2022-02-20 14:22:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:22:54,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:22:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2022-02-20 14:22:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2022-02-20 14:22:54,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2022-02-20 14:22:54,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:54,200 INFO L225 Difference]: With dead ends: 59 [2022-02-20 14:22:54,200 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:22:54,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-02-20 14:22:54,206 INFO L933 BasicCegarLoop]: 38 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, 38 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-02-20 14:22:54,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:22:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 14:22:54,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:54,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:54,239 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:54,240 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:54,246 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:22:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:22:54,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:54,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:54,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-20 14:22:54,248 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-20 14:22:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:54,251 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:22:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:22:54,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:54,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:54,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:54,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-02-20 14:22:54,257 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-02-20 14:22:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:54,257 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-20 14:22:54,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:22:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:22:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:22:54,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:54,259 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:22:54,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:22:54,260 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:54,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:54,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2136147464, now seen corresponding path program 1 times [2022-02-20 14:22:54,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:54,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935332908] [2022-02-20 14:22:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:54,312 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:54,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797808291] [2022-02-20 14:22:54,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:54,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:54,315 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-02-20 14:22:54,316 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-02-20 14:22:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:54,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:22:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:54,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:54,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {207#true} is VALID [2022-02-20 14:22:54,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {207#true} is VALID [2022-02-20 14:22:54,684 INFO L272 TraceCheckUtils]: 2: Hoare triple {207#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {207#true} is VALID [2022-02-20 14:22:54,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {207#true} ~cond := #in~cond; {221#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:22:54,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {221#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {225#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:54,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {225#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:22:54,687 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {225#(not (= |assume_abort_if_not_#in~cond| 0))} {207#true} #104#return; {232#(< 0 ~ARR_SIZE~0)} is VALID [2022-02-20 14:22:54,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(< 0 ~ARR_SIZE~0)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {236#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} is VALID [2022-02-20 14:22:54,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 0))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {208#false} is VALID [2022-02-20 14:22:54,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {208#false} is VALID [2022-02-20 14:22:54,692 INFO L272 TraceCheckUtils]: 10: Hoare triple {208#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {208#false} is VALID [2022-02-20 14:22:54,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 14:22:54,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {208#false} assume !(0 == ~cond); {208#false} is VALID [2022-02-20 14:22:54,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {208#false} assume true; {208#false} is VALID [2022-02-20 14:22:54,693 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {208#false} {208#false} #106#return; {208#false} is VALID [2022-02-20 14:22:54,693 INFO L272 TraceCheckUtils]: 15: Hoare triple {208#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {208#false} is VALID [2022-02-20 14:22:54,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 14:22:54,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {208#false} assume !(0 == ~cond); {208#false} is VALID [2022-02-20 14:22:54,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {208#false} assume true; {208#false} is VALID [2022-02-20 14:22:54,694 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {208#false} {208#false} #108#return; {208#false} is VALID [2022-02-20 14:22:54,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {208#false} assume main_~index1~0#1 + main_~index2~0#1 == ~ARR_SIZE~0 - 1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {208#false} is VALID [2022-02-20 14:22:54,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {208#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if main_~index1~0#1 % 4294967296 <= 2147483647 then main_~index1~0#1 % 4294967296 else main_~index1~0#1 % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * (if main_~index2~0#1 % 4294967296 <= 2147483647 then main_~index2~0#1 % 4294967296 else main_~index2~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {208#false} is VALID [2022-02-20 14:22:54,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {208#false} assume 0 == main_~temp~0#1; {208#false} is VALID [2022-02-20 14:22:54,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {208#false} main_~row~0#1 := 0; {208#false} is VALID [2022-02-20 14:22:54,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {208#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {208#false} is VALID [2022-02-20 14:22:54,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {208#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {208#false} is VALID [2022-02-20 14:22:54,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {208#false} assume 0 == __VERIFIER_assert_~cond#1; {208#false} is VALID [2022-02-20 14:22:54,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 14:22:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:22:54,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:54,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:54,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935332908] [2022-02-20 14:22:54,698 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:54,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797808291] [2022-02-20 14:22:54,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797808291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:54,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:54,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:22:54,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109057372] [2022-02-20 14:22:54,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:54,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:22:54,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:54,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:54,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:54,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:22:54,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:54,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:22:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:22:54,733 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:55,005 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-02-20 14:22:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:22:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-02-20 14:22:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-02-20 14:22:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-02-20 14:22:55,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2022-02-20 14:22:55,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:55,086 INFO L225 Difference]: With dead ends: 58 [2022-02-20 14:22:55,087 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 14:22:55,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:22:55,090 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:55,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 52 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:22:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 14:22:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-02-20 14:22:55,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:55,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,116 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,116 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:55,124 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-02-20 14:22:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-02-20 14:22:55,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:55,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:55,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-02-20 14:22:55,126 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-02-20 14:22:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:55,130 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-02-20 14:22:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-02-20 14:22:55,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:55,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:55,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:55,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-02-20 14:22:55,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-02-20 14:22:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:55,148 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-02-20 14:22:55,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 14:22:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:22:55,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:55,150 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 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-02-20 14:22:55,183 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-02-20 14:22:55,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:55,352 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:55,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1984127527, now seen corresponding path program 1 times [2022-02-20 14:22:55,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:55,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98914933] [2022-02-20 14:22:55,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:55,379 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:55,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524399771] [2022-02-20 14:22:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:55,381 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-02-20 14:22:55,391 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-02-20 14:22:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:55,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:22:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:55,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:55,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {500#true} is VALID [2022-02-20 14:22:55,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {500#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ite10#1, main_#t~mem9#1, main_#t~nondet11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~post12#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {500#true} is VALID [2022-02-20 14:22:55,611 INFO L272 TraceCheckUtils]: 2: Hoare triple {500#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {500#true} is VALID [2022-02-20 14:22:55,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {500#true} ~cond := #in~cond; {500#true} is VALID [2022-02-20 14:22:55,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {500#true} assume !(0 == ~cond); {500#true} is VALID [2022-02-20 14:22:55,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#true} assume true; {500#true} is VALID [2022-02-20 14:22:55,614 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {500#true} {500#true} #104#return; {500#true} is VALID [2022-02-20 14:22:55,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {526#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:22:55,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {530#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:22:55,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:55,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {501#false} is VALID [2022-02-20 14:22:55,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {501#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:55,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {501#false} is VALID [2022-02-20 14:22:55,618 INFO L272 TraceCheckUtils]: 13: Hoare triple {501#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {501#false} is VALID [2022-02-20 14:22:55,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {501#false} ~cond := #in~cond; {501#false} is VALID [2022-02-20 14:22:55,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {501#false} assume !(0 == ~cond); {501#false} is VALID [2022-02-20 14:22:55,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {501#false} assume true; {501#false} is VALID [2022-02-20 14:22:55,619 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {501#false} {501#false} #106#return; {501#false} is VALID [2022-02-20 14:22:55,619 INFO L272 TraceCheckUtils]: 18: Hoare triple {501#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {501#false} is VALID [2022-02-20 14:22:55,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {501#false} ~cond := #in~cond; {501#false} is VALID [2022-02-20 14:22:55,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {501#false} assume !(0 == ~cond); {501#false} is VALID [2022-02-20 14:22:55,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {501#false} assume true; {501#false} is VALID [2022-02-20 14:22:55,620 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {501#false} {501#false} #108#return; {501#false} is VALID [2022-02-20 14:22:55,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {501#false} assume main_~index1~0#1 + main_~index2~0#1 == ~ARR_SIZE~0 - 1;main_#t~ite10#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {501#false} is VALID [2022-02-20 14:22:55,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {501#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if main_~index1~0#1 % 4294967296 <= 2147483647 then main_~index1~0#1 % 4294967296 else main_~index1~0#1 % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * (if main_~index2~0#1 % 4294967296 <= 2147483647 then main_~index2~0#1 % 4294967296 else main_~index2~0#1 % 4294967296 - 4294967296), 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {501#false} is VALID [2022-02-20 14:22:55,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {501#false} assume 0 == main_~temp~0#1; {501#false} is VALID [2022-02-20 14:22:55,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {501#false} main_~row~0#1 := 0; {501#false} is VALID [2022-02-20 14:22:55,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {501#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {501#false} is VALID [2022-02-20 14:22:55,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {501#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:55,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {501#false} main_#t~post12#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {501#false} is VALID [2022-02-20 14:22:55,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {501#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {501#false} is VALID [2022-02-20 14:22:55,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {501#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~sum~0#1 >= 0 && main_~sum~0#1 <= ~ARR_SIZE~0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {501#false} is VALID [2022-02-20 14:22:55,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {501#false} assume 0 == __VERIFIER_assert_~cond#1; {501#false} is VALID [2022-02-20 14:22:55,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {501#false} assume !false; {501#false} is VALID [2022-02-20 14:22:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:22:55,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:22:55,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:22:55,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98914933] [2022-02-20 14:22:55,628 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:22:55,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524399771] [2022-02-20 14:22:55,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524399771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:22:55,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:22:55,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:22:55,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16334403] [2022-02-20 14:22:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:22:55,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-02-20 14:22:55,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:22:55,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:55,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:22:55,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:22:55,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:22:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:22:55,657 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:55,785 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-20 14:22:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:22:55,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-02-20 14:22:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:22:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-02-20 14:22:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-02-20 14:22:55,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2022-02-20 14:22:55,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:22:55,871 INFO L225 Difference]: With dead ends: 61 [2022-02-20 14:22:55,871 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:22:55,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:22:55,875 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:22:55,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 47 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:22:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:22:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-02-20 14:22:55,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:22:55,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,902 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,903 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:55,905 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:22:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:22:55,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:55,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:55,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-02-20 14:22:55,912 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-02-20 14:22:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:22:55,914 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:22:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:22:55,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:22:55,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:22:55,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:22:55,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:22:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:22:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-02-20 14:22:55,919 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 34 [2022-02-20 14:22:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:22:55,919 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-02-20 14:22:55,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:22:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-20 14:22:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:22:55,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:22:55,921 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 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-02-20 14:22:55,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:22:56,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:22:56,146 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:22:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:22:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1380575367, now seen corresponding path program 1 times [2022-02-20 14:22:56,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:22:56,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166413733] [2022-02-20 14:22:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:22:56,169 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:22:56,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781768732] [2022-02-20 14:22:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:22:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:22:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:22:56,172 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-02-20 14:22:56,187 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-02-20 14:22:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:56,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 14:22:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:22:56,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:22:56,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-02-20 14:22:56,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:22:56,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:22:58,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 297 [2022-02-20 14:23:00,304 INFO L356 Elim1Store]: treesize reduction 428, result has 1.2 percent of original size [2022-02-20 14:23:00,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 8 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 308 treesize of output 2651