./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array18_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/array18_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 4d58909a91b196e39d7623dd2e1e4d9b2698d6fa8ff06c2897eb5762e2e2e408 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:23:10,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:23:10,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:23:10,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:23:10,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:23:10,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:23:10,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:23:10,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:23:10,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:23:10,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:23:10,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:23:10,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:23:10,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:23:10,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:23:10,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:23:10,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:23:10,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:23:10,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:23:10,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:23:10,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:23:10,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:23:10,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:23:10,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:23:10,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:23:10,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:23:10,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:23:10,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:23:10,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:23:10,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:23:10,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:23:10,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:23:10,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:23:10,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:23:10,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:23:10,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:23:10,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:23:10,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:23:10,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:23:10,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:23:10,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:23:10,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:23:10,375 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:23:10,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:23:10,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:23:10,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:23:10,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:23:10,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:23:10,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:23:10,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:23:10,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:23:10,436 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:23:10,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:23:10,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:23:10,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:23:10,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:23:10,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:23:10,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:23:10,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:23:10,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:23:10,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:23:10,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:23:10,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:23:10,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:23:10,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:23:10,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:23:10,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:23:10,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:10,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:23:10,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:23:10,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:23:10,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:23:10,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:23:10,454 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:23:10,454 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:23:10,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:23:10,455 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 -> 4d58909a91b196e39d7623dd2e1e4d9b2698d6fa8ff06c2897eb5762e2e2e408 [2022-02-20 14:23:10,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:23:10,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:23:10,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:23:10,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:23:10,658 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:23:10,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array18_pattern.c [2022-02-20 14:23:10,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9540c151/1fc8dd03088f459d8f7c091514d8eb0a/FLAGa11e13f95 [2022-02-20 14:23:11,045 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:23:11,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array18_pattern.c [2022-02-20 14:23:11,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9540c151/1fc8dd03088f459d8f7c091514d8eb0a/FLAGa11e13f95 [2022-02-20 14:23:11,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9540c151/1fc8dd03088f459d8f7c091514d8eb0a [2022-02-20 14:23:11,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:23:11,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:23:11,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:11,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:23:11,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:23:11,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1838b725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11, skipping insertion in model container [2022-02-20 14:23:11,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:23:11,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:23:11,190 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/array18_pattern.c[1444,1457] [2022-02-20 14:23:11,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:11,219 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:23:11,237 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/array18_pattern.c[1444,1457] [2022-02-20 14:23:11,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:11,268 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:23:11,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11 WrapperNode [2022-02-20 14:23:11,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:11,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:11,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:23:11,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:23:11,286 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:23:11" (1/1) ... [2022-02-20 14:23:11,300 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:23:11" (1/1) ... [2022-02-20 14:23:11,339 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 102 [2022-02-20 14:23:11,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:11,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:23:11,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:23:11,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:23:11,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:23:11,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:23:11,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:23:11,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:23:11,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (1/1) ... [2022-02-20 14:23:11,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:11,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:11,417 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:23:11,430 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:23:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:23:11,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:23:11,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:23:11,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:23:11,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:23:11,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:23:11,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:23:11,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:23:11,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:23:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:23:11,511 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:23:11,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:23:11,735 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:23:11,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:23:11,741 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:23:11,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:23:11 BoogieIcfgContainer [2022-02-20 14:23:11,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:23:11,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:23:11,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:23:11,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:23:11,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:23:11" (1/3) ... [2022-02-20 14:23:11,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b891b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:23:11, skipping insertion in model container [2022-02-20 14:23:11,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:11" (2/3) ... [2022-02-20 14:23:11,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b891b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:23:11, skipping insertion in model container [2022-02-20 14:23:11,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:23:11" (3/3) ... [2022-02-20 14:23:11,749 INFO L111 eAbstractionObserver]: Analyzing ICFG array18_pattern.c [2022-02-20 14:23:11,753 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:23:11,753 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:23:11,810 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:23:11,820 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:23:11,820 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:23:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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:23:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:23:11,844 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:11,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:11,845 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2132324569, now seen corresponding path program 1 times [2022-02-20 14:23:11,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:11,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819298011] [2022-02-20 14:23:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:23:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:12,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 14:23:12,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 14:23:12,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 14:23:12,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #111#return; {37#false} is VALID [2022-02-20 14:23:12,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#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; {36#true} is VALID [2022-02-20 14:23:12,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#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~ite12#1, main_#t~mem11#1, main_#t~nondet13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~post14#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; {36#true} is VALID [2022-02-20 14:23:12,038 INFO L272 TraceCheckUtils]: 2: Hoare triple {36#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {36#true} is VALID [2022-02-20 14:23:12,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 14:23:12,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 14:23:12,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 14:23:12,039 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37#false} {36#true} #111#return; {37#false} is VALID [2022-02-20 14:23:12,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#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; {37#false} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {37#false} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume false; {37#false} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#false} main_~row~0#1 := 0; {37#false} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {37#false} is VALID [2022-02-20 14:23:12,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {37#false} is VALID [2022-02-20 14:23:12,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#false} assume 0 == __VERIFIER_assert_~cond#1; {37#false} is VALID [2022-02-20 14:23:12,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 14:23:12,041 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:23:12,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:12,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819298011] [2022-02-20 14:23:12,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819298011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:12,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:12,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:23:12,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786813829] [2022-02-20 14:23:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:12,048 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:23:12,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:12,052 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:23:12,080 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:23:12,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:23:12,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:23:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:23:12,150 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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:23:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:12,214 INFO L93 Difference]: Finished difference Result 63 states and 97 transitions. [2022-02-20 14:23:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:23:12,215 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:23:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:12,216 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:23:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 14:23:12,224 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:23:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 14:23:12,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-20 14:23:12,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:12,354 INFO L225 Difference]: With dead ends: 63 [2022-02-20 14:23:12,354 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 14:23:12,356 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:23:12,359 INFO L933 BasicCegarLoop]: 41 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, 41 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:23:12,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 14:23:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 14:23:12,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:12,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:23:12,387 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:23:12,389 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:23:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:12,400 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 14:23:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 14:23:12,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:12,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:12,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 29 states. [2022-02-20 14:23:12,403 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 29 states. [2022-02-20 14:23:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:12,409 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 14:23:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 14:23:12,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:12,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:12,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:12,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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:23:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-02-20 14:23:12,420 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2022-02-20 14:23:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:12,421 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-02-20 14:23:12,421 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:23:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 14:23:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:23:12,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:12,427 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] [2022-02-20 14:23:12,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:23:12,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:12,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1872922357, now seen corresponding path program 1 times [2022-02-20 14:23:12,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:12,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015130439] [2022-02-20 14:23:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:12,462 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:12,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112871090] [2022-02-20 14:23:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:12,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:12,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:12,465 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:23:12,466 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:23:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:12,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:23:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:12,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:12,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#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; {219#true} is VALID [2022-02-20 14:23:12,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#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~ite12#1, main_#t~mem11#1, main_#t~nondet13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~post14#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; {219#true} is VALID [2022-02-20 14:23:12,783 INFO L272 TraceCheckUtils]: 2: Hoare triple {219#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {219#true} is VALID [2022-02-20 14:23:12,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#true} ~cond := #in~cond; {219#true} is VALID [2022-02-20 14:23:12,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {219#true} assume !(0 == ~cond); {219#true} is VALID [2022-02-20 14:23:12,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 14:23:12,784 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {219#true} {219#true} #111#return; {219#true} is VALID [2022-02-20 14:23:12,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#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; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} 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; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,793 INFO L272 TraceCheckUtils]: 10: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {219#true} is VALID [2022-02-20 14:23:12,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#true} ~cond := #in~cond; {219#true} is VALID [2022-02-20 14:23:12,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {219#true} assume !(0 == ~cond); {219#true} is VALID [2022-02-20 14:23:12,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 14:23:12,795 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {219#true} {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} #113#return; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,795 INFO L272 TraceCheckUtils]: 15: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {219#true} is VALID [2022-02-20 14:23:12,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {219#true} ~cond := #in~cond; {219#true} is VALID [2022-02-20 14:23:12,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {219#true} assume !(0 == ~cond); {219#true} is VALID [2022-02-20 14:23:12,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 14:23:12,797 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {219#true} {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} #115#return; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume main_~index1~0#1 == main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume main_~index1~0#1 == main_~index2~0#1;main_#t~ite12#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} call write~int(main_#t~ite12#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - 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 * main_~index2~0#1, 4);havoc main_#t~ite12#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 == main_~temp~0#1; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~row~0#1 := 0; {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:12,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {245#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {306#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:12,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {306#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {220#false} is VALID [2022-02-20 14:23:12,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-02-20 14:23:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:23:12,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:12,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:12,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015130439] [2022-02-20 14:23:12,814 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:12,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112871090] [2022-02-20 14:23:12,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112871090] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:12,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:12,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:23:12,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318949349] [2022-02-20 14:23:12,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 14:23:12,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:12,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:12,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:12,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:23:12,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:12,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:23:12,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:23:12,848 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:12,937 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:23:12,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:23:12,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-02-20 14:23:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 14:23:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 14:23:12,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 14:23:12,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:12,998 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:23:12,998 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:23:12,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:23:13,002 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:13,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:23:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 14:23:13,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:13,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:23:13,016 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:23:13,016 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:23:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:13,021 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 14:23:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 14:23:13,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:13,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:13,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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 32 states. [2022-02-20 14:23:13,023 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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 32 states. [2022-02-20 14:23:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:13,030 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 14:23:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 14:23:13,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:13,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:13,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:13,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:23:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-02-20 14:23:13,040 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 30 [2022-02-20 14:23:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:13,041 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-02-20 14:23:13,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:23:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 14:23:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:23:13,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:13,048 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] [2022-02-20 14:23:13,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:23:13,251 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:23:13,252 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:13,253 INFO L85 PathProgramCache]: Analyzing trace with hash 212512359, now seen corresponding path program 1 times [2022-02-20 14:23:13,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:13,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924781206] [2022-02-20 14:23:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:13,278 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:13,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714341201] [2022-02-20 14:23:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:13,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:13,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:13,281 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:23:13,284 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:23:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:13,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:23:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:13,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:13,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#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; {466#true} is VALID [2022-02-20 14:23:13,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#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~ite12#1, main_#t~mem11#1, main_#t~nondet13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~post14#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; {466#true} is VALID [2022-02-20 14:23:13,530 INFO L272 TraceCheckUtils]: 2: Hoare triple {466#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {466#true} is VALID [2022-02-20 14:23:13,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#true} ~cond := #in~cond; {466#true} is VALID [2022-02-20 14:23:13,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {466#true} assume !(0 == ~cond); {466#true} is VALID [2022-02-20 14:23:13,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} assume true; {466#true} is VALID [2022-02-20 14:23:13,531 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {466#true} {466#true} #111#return; {466#true} is VALID [2022-02-20 14:23:13,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#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; {492#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:13,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {496#(<= ~ARR_SIZE~0 0)} 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; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,534 INFO L272 TraceCheckUtils]: 10: Hoare triple {496#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {496#(<= ~ARR_SIZE~0 0)} ~cond := #in~cond; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {496#(<= ~ARR_SIZE~0 0)} assume !(0 == ~cond); {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {496#(<= ~ARR_SIZE~0 0)} assume true; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,536 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {496#(<= ~ARR_SIZE~0 0)} {496#(<= ~ARR_SIZE~0 0)} #113#return; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,537 INFO L272 TraceCheckUtils]: 15: Hoare triple {496#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {496#(<= ~ARR_SIZE~0 0)} ~cond := #in~cond; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {496#(<= ~ARR_SIZE~0 0)} assume !(0 == ~cond); {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {496#(<= ~ARR_SIZE~0 0)} assume true; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,539 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {496#(<= ~ARR_SIZE~0 0)} {496#(<= ~ARR_SIZE~0 0)} #115#return; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {496#(<= ~ARR_SIZE~0 0)} assume main_~index1~0#1 == main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {496#(<= ~ARR_SIZE~0 0)} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {496#(<= ~ARR_SIZE~0 0)} assume main_~index1~0#1 == main_~index2~0#1;main_#t~ite12#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {496#(<= ~ARR_SIZE~0 0)} call write~int(main_#t~ite12#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - 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 * main_~index2~0#1, 4);havoc main_#t~ite12#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {496#(<= ~ARR_SIZE~0 0)} assume 0 == main_~temp~0#1; {496#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:13,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {496#(<= ~ARR_SIZE~0 0)} main_~row~0#1 := 0; {548#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} is VALID [2022-02-20 14:23:13,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {548#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {467#false} is VALID [2022-02-20 14:23:13,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {467#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem16#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem16#1;havoc main_#t~mem16#1; {467#false} is VALID [2022-02-20 14:23:13,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {467#false} main_#t~post15#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {467#false} is VALID [2022-02-20 14:23:13,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {467#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {467#false} is VALID [2022-02-20 14:23:13,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {467#false} main_#t~post14#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {467#false} is VALID [2022-02-20 14:23:13,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {467#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {467#false} is VALID [2022-02-20 14:23:13,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {467#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {467#false} is VALID [2022-02-20 14:23:13,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {467#false} assume 0 == __VERIFIER_assert_~cond#1; {467#false} is VALID [2022-02-20 14:23:13,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-02-20 14:23:13,545 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:23:13,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:13,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:13,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924781206] [2022-02-20 14:23:13,546 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:13,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714341201] [2022-02-20 14:23:13,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714341201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:13,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:13,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:23:13,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138887922] [2022-02-20 14:23:13,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 35 [2022-02-20 14:23:13,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:13,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:23:13,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:13,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:23:13,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:13,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:23:13,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:23:13,576 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:23:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:13,819 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-02-20 14:23:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:23:13,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 35 [2022-02-20 14:23:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:23:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-02-20 14:23:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:23:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-02-20 14:23:13,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-02-20 14:23:13,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:13,894 INFO L225 Difference]: With dead ends: 67 [2022-02-20 14:23:13,894 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:23:13,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:23:13,895 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:13,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 98 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:23:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-02-20 14:23:13,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:13,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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:23:13,902 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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:23:13,903 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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:23:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:13,905 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-02-20 14:23:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2022-02-20 14:23:13,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:13,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:13,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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 42 states. [2022-02-20 14:23:13,906 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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 42 states. [2022-02-20 14:23:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:13,908 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-02-20 14:23:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2022-02-20 14:23:13,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:13,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:13,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:13,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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:23:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-20 14:23:13,911 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 35 [2022-02-20 14:23:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:13,911 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-20 14:23:13,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:23:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 14:23:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:23:13,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:13,913 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:23:13,941 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:23:14,127 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:23:14,128 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -654332553, now seen corresponding path program 1 times [2022-02-20 14:23:14,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:14,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116188467] [2022-02-20 14:23:14,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:14,154 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:14,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444566042] [2022-02-20 14:23:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:14,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:14,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:14,156 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:23:14,180 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:23:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:14,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:23:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:14,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:14,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {797#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; {797#true} is VALID [2022-02-20 14:23:14,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {797#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~ite12#1, main_#t~mem11#1, main_#t~nondet13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~post14#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; {797#true} is VALID [2022-02-20 14:23:14,363 INFO L272 TraceCheckUtils]: 2: Hoare triple {797#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {797#true} is VALID [2022-02-20 14:23:14,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {797#true} ~cond := #in~cond; {797#true} is VALID [2022-02-20 14:23:14,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {797#true} assume !(0 == ~cond); {797#true} is VALID [2022-02-20 14:23:14,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {797#true} assume true; {797#true} is VALID [2022-02-20 14:23:14,364 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {797#true} {797#true} #111#return; {797#true} is VALID [2022-02-20 14:23:14,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {797#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; {823#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:14,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {823#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {827#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:14,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {798#false} is VALID [2022-02-20 14:23:14,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {798#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {798#false} is VALID [2022-02-20 14:23:14,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {798#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {798#false} is VALID [2022-02-20 14:23:14,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {798#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; {798#false} is VALID [2022-02-20 14:23:14,367 INFO L272 TraceCheckUtils]: 13: Hoare triple {798#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {798#false} is VALID [2022-02-20 14:23:14,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {798#false} ~cond := #in~cond; {798#false} is VALID [2022-02-20 14:23:14,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {798#false} assume !(0 == ~cond); {798#false} is VALID [2022-02-20 14:23:14,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {798#false} assume true; {798#false} is VALID [2022-02-20 14:23:14,368 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {798#false} {798#false} #113#return; {798#false} is VALID [2022-02-20 14:23:14,368 INFO L272 TraceCheckUtils]: 18: Hoare triple {798#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {798#false} is VALID [2022-02-20 14:23:14,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {798#false} ~cond := #in~cond; {798#false} is VALID [2022-02-20 14:23:14,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {798#false} assume !(0 == ~cond); {798#false} is VALID [2022-02-20 14:23:14,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#false} assume true; {798#false} is VALID [2022-02-20 14:23:14,369 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {798#false} {798#false} #115#return; {798#false} is VALID [2022-02-20 14:23:14,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {798#false} assume main_~index1~0#1 == main_~index2~0#1;main_#t~ite10#1 := main_~num~0#1; {798#false} is VALID [2022-02-20 14:23:14,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {798#false} call write~int(main_#t~ite10#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ite10#1;havoc main_#t~mem9#1; {798#false} is VALID [2022-02-20 14:23:14,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {798#false} assume main_~index1~0#1 == main_~index2~0#1;main_#t~ite12#1 := main_~num~0#1 * main_~num~0#1 * main_~num~0#1 * main_~num~0#1; {798#false} is VALID [2022-02-20 14:23:14,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {798#false} call write~int(main_#t~ite12#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - 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 * main_~index2~0#1, 4);havoc main_#t~ite12#1;havoc main_#t~mem11#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {798#false} is VALID [2022-02-20 14:23:14,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {798#false} assume 0 == main_~temp~0#1; {798#false} is VALID [2022-02-20 14:23:14,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {798#false} main_~row~0#1 := 0; {798#false} is VALID [2022-02-20 14:23:14,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {798#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {798#false} is VALID [2022-02-20 14:23:14,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {798#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem16#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem16#1;havoc main_#t~mem16#1; {798#false} is VALID [2022-02-20 14:23:14,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {798#false} main_#t~post15#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {798#false} is VALID [2022-02-20 14:23:14,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {798#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {798#false} is VALID [2022-02-20 14:23:14,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {798#false} main_#t~post14#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {798#false} is VALID [2022-02-20 14:23:14,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {798#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {798#false} is VALID [2022-02-20 14:23:14,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {798#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {798#false} is VALID [2022-02-20 14:23:14,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {798#false} assume 0 == __VERIFIER_assert_~cond#1; {798#false} is VALID [2022-02-20 14:23:14,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {798#false} assume !false; {798#false} is VALID [2022-02-20 14:23:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:23:14,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:14,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:14,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116188467] [2022-02-20 14:23:14,374 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:14,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444566042] [2022-02-20 14:23:14,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444566042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:14,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:14,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:23:14,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607465881] [2022-02-20 14:23:14,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 38 [2022-02-20 14:23:14,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:14,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:23:14,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:14,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:23:14,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:23:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:23:14,402 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:23:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:14,522 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-02-20 14:23:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:23:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 38 [2022-02-20 14:23:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:23:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 14:23:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:23:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 14:23:14,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-02-20 14:23:14,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:14,590 INFO L225 Difference]: With dead ends: 64 [2022-02-20 14:23:14,590 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:23:14,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:23:14,592 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 53 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:23:14,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 53 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:23:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-02-20 14:23:14,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:14,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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:23:14,608 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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:23:14,608 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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:23:14,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:14,610 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-02-20 14:23:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-02-20 14:23:14,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:14,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:14,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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 36 states. [2022-02-20 14:23:14,611 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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 36 states. [2022-02-20 14:23:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:14,613 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-02-20 14:23:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-02-20 14:23:14,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:14,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:14,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:14,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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:23:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-02-20 14:23:14,615 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 38 [2022-02-20 14:23:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:14,616 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-02-20 14:23:14,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:23:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 14:23:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 14:23:14,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:14,617 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, 1, 1] [2022-02-20 14:23:14,639 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-02-20 14:23:14,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:14,828 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash 579061941, now seen corresponding path program 1 times [2022-02-20 14:23:14,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:14,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263288504] [2022-02-20 14:23:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:14,867 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:14,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120438376] [2022-02-20 14:23:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:14,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:14,874 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-02-20 14:23:14,900 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-02-20 14:23:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:15,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 14:23:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:15,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:15,849 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 171 treesize of output 162 [2022-02-20 14:23:15,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 731 [2022-02-20 14:23:15,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:15,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:15,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:15,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:15,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:16,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:16,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:16,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:16,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 553