/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:41:50,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:41:50,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:41:50,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:41:50,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:41:50,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:41:50,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:41:50,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:41:50,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:41:50,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:41:50,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:41:50,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:41:50,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:41:50,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:41:50,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:41:50,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:41:50,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:41:50,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:41:50,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:41:50,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:41:50,417 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:41:50,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:41:50,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:41:50,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:41:50,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:41:50,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:41:50,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:41:50,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:41:50,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:41:50,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:41:50,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:41:50,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:41:50,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:41:50,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:41:50,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:41:50,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:41:50,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:41:50,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:41:50,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:41:50,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:41:50,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:41:50,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:41:50,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:41:50,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:41:50,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:41:50,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:41:50,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:41:50,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:41:50,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:41:50,459 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:41:50,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:41:50,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:41:50,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:41:50,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:41:50,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:41:50,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:41:50,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:41:50,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:41:50,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:50,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:41:50,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:41:50,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:41:50,462 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:41:50,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:41:50,462 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:41:50,462 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:41:50,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:41:50,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:41:50,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:41:50,644 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:41:50,645 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:41:50,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c [2022-04-27 21:41:50,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/656e95739/4c627f1cca5a48f4a66da4764ebfccda/FLAGbc87788fa [2022-04-27 21:41:50,999 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:41:51,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c [2022-04-27 21:41:51,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/656e95739/4c627f1cca5a48f4a66da4764ebfccda/FLAGbc87788fa [2022-04-27 21:41:51,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/656e95739/4c627f1cca5a48f4a66da4764ebfccda [2022-04-27 21:41:51,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:41:51,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:41:51,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:51,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:41:51,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:41:51,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af7eaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51, skipping insertion in model container [2022-04-27 21:41:51,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:41:51,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:41:51,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c[1110,1123] [2022-04-27 21:41:51,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:51,568 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:41:51,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c[1110,1123] [2022-04-27 21:41:51,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:51,586 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:41:51,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51 WrapperNode [2022-04-27 21:41:51,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:51,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:41:51,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:41:51,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:41:51,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:41:51,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:41:51,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:41:51,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:41:51,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:51,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:51,633 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-04-27 21:41:51,638 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-04-27 21:41:51,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:41:51,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:41:51,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:41:51,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:41:51,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:41:51,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:41:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:41:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:41:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:41:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:41:51,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:41:51,694 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:41:51,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:41:51,822 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:41:51,827 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:41:51,827 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 21:41:51,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:51 BoogieIcfgContainer [2022-04-27 21:41:51,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:41:51,828 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:41:51,828 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:41:51,829 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:41:51,831 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,832 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:41:51,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:51 BasicIcfg [2022-04-27 21:41:51,846 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:41:51,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:41:51,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:41:51,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:41:51,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:41:51" (1/4) ... [2022-04-27 21:41:51,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c610470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:51, skipping insertion in model container [2022-04-27 21:41:51,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (2/4) ... [2022-04-27 21:41:51,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c610470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:51, skipping insertion in model container [2022-04-27 21:41:51,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:51" (3/4) ... [2022-04-27 21:41:51,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c610470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:51, skipping insertion in model container [2022-04-27 21:41:51,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:51" (4/4) ... [2022-04-27 21:41:51,851 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.c.i.v+cfa-reducer.cqvasr [2022-04-27 21:41:51,859 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:41:51,859 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:41:51,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:41:51,892 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4aa53355, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bd49573 [2022-04-27 21:41:51,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:41:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:41:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:41:51,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:51,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:51,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1936523046, now seen corresponding path program 1 times [2022-04-27 21:41:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824684778] [2022-04-27 21:41:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:51,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {20#true} is VALID [2022-04-27 21:41:52,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 21:41:52,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 21:41:52,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {20#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:52,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {20#true} is VALID [2022-04-27 21:41:52,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 21:41:52,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20#true} {20#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 21:41:52,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {20#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 21:41:52,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {20#true} is VALID [2022-04-27 21:41:52,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 21:41:52,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {25#(and (or (< 0 (+ main_~main__y~0 1)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} is VALID [2022-04-27 21:41:52,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#(and (or (< 0 (+ main_~main__y~0 1)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {26#(and (or (< 0 (+ main_~main__y~0 1)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} is VALID [2022-04-27 21:41:52,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#(and (or (< 0 (+ main_~main__y~0 1)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {27#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:41:52,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#(not (= main_~__VERIFIER_assert__cond~0 0))} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {21#false} is VALID [2022-04-27 21:41:52,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {21#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#false} is VALID [2022-04-27 21:41:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:52,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824684778] [2022-04-27 21:41:52,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824684778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:52,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:52,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:41:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019392963] [2022-04-27 21:41:52,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:52,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:41:52,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:52,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:41:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:52,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:41:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:41:52,315 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:52,675 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 21:41:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:41:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:41:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 21:41:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 21:41:52,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-27 21:41:52,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:52,740 INFO L225 Difference]: With dead ends: 32 [2022-04-27 21:41:52,740 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:41:52,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:41:52,749 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:52,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:41:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:41:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:41:52,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:52,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,775 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,775 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:52,780 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:52,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:52,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:52,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:41:52,781 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:41:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:52,783 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:52,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:52,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:52,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:52,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 21:41:52,788 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 21:41:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:52,789 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 21:41:52,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:41:52,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:52,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:52,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:41:52,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 96372484, now seen corresponding path program 1 times [2022-04-27 21:41:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:52,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895407643] [2022-04-27 21:41:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {125#true} is VALID [2022-04-27 21:41:52,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:52,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {125#true} {125#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:52,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {125#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:52,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {125#true} is VALID [2022-04-27 21:41:52,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:52,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:52,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {125#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:52,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {125#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {125#true} is VALID [2022-04-27 21:41:52,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:52,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {130#(and (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)))} is VALID [2022-04-27 21:41:52,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#(and (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)))} [56] L40-->L40: Formula: (and (= v_main_~main__x~0_2 (+ (- 1) v_main_~main__x~0_3)) (= (+ (- 1) v_main_~main__y~0_3) v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__y~0_3) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__x~0_3) (not (= 0 v_main_~main__x~0_3))) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] {131#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} is VALID [2022-04-27 21:41:52,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {131#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {132#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} is VALID [2022-04-27 21:41:52,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {132#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {133#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:41:52,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#(not (= main_~__VERIFIER_assert__cond~0 0))} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {126#false} is VALID [2022-04-27 21:41:52,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {126#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#false} is VALID [2022-04-27 21:41:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895407643] [2022-04-27 21:41:52,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895407643] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:41:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353486657] [2022-04-27 21:41:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:52,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:52,956 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-04-27 21:41:52,975 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-04-27 21:41:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:53,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 21:41:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:53,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:41:53,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {125#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {125#true} is VALID [2022-04-27 21:41:53,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {125#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {125#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {125#true} is VALID [2022-04-27 21:41:53,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {159#(and (= main_~main__i~0 main_~main__x~0) (= main_~main__j~0 main_~main__y~0))} is VALID [2022-04-27 21:41:53,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~main__i~0 main_~main__x~0) (= main_~main__j~0 main_~main__y~0))} [56] L40-->L40: Formula: (and (= v_main_~main__x~0_2 (+ (- 1) v_main_~main__x~0_3)) (= (+ (- 1) v_main_~main__y~0_3) v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__y~0_3) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__x~0_3) (not (= 0 v_main_~main__x~0_3))) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] {163#(and (= (+ (- 1) main_~main__i~0) main_~main__x~0) (= (+ main_~main__y~0 1) main_~main__j~0))} is VALID [2022-04-27 21:41:53,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#(and (= (+ (- 1) main_~main__i~0) main_~main__x~0) (= (+ main_~main__y~0 1) main_~main__j~0))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {167#(and (= (+ main_~main__y~0 1) main_~main__j~0) (= (+ (- 1) main_~main__i~0) 0))} is VALID [2022-04-27 21:41:53,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#(and (= (+ main_~main__y~0 1) main_~main__j~0) (= (+ (- 1) main_~main__i~0) 0))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {171#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 21:41:53,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(<= 1 main_~__VERIFIER_assert__cond~0)} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {126#false} is VALID [2022-04-27 21:41:53,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {126#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#false} is VALID [2022-04-27 21:41:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:53,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:41:53,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {126#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#false} is VALID [2022-04-27 21:41:53,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(<= 1 main_~__VERIFIER_assert__cond~0)} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {126#false} is VALID [2022-04-27 21:41:53,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#(or (not (= main_~main__j~0 main_~main__i~0)) (= main_~main__y~0 0))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {171#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 21:41:53,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= main_~main__x~0 0)) (= main_~main__y~0 0))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {184#(or (not (= main_~main__j~0 main_~main__i~0)) (= main_~main__y~0 0))} is VALID [2022-04-27 21:41:53,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= (+ (- 1) main_~main__x~0) 0)) (= (+ (- 1) main_~main__y~0) 0))} [56] L40-->L40: Formula: (and (= v_main_~main__x~0_2 (+ (- 1) v_main_~main__x~0_3)) (= (+ (- 1) v_main_~main__y~0_3) v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__y~0_3) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__x~0_3) (not (= 0 v_main_~main__x~0_3))) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] {188#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= main_~main__x~0 0)) (= main_~main__y~0 0))} is VALID [2022-04-27 21:41:53,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {192#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= (+ (- 1) main_~main__x~0) 0)) (= (+ (- 1) main_~main__y~0) 0))} is VALID [2022-04-27 21:41:53,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {125#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {125#true} is VALID [2022-04-27 21:41:53,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {125#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {125#true} is VALID [2022-04-27 21:41:53,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {125#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#true} is VALID [2022-04-27 21:41:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:53,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353486657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:41:53,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:41:53,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-27 21:41:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917851840] [2022-04-27 21:41:53,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:41:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:53,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:53,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:53,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:41:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:41:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:41:53,424 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:53,656 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 21:41:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:41:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2022-04-27 21:41:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2022-04-27 21:41:53,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2022-04-27 21:41:53,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:53,675 INFO L225 Difference]: With dead ends: 17 [2022-04-27 21:41:53,675 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:41:53,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-04-27 21:41:53,677 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:53,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:41:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:41:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:41:53,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:53,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:53,678 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:53,678 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:53,678 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:53,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:53,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:53,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:41:53,678 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:41:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:53,679 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:53,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:53,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:53,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:53,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:41:53,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 21:41:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:53,679 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:41:53,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:53,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:53,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:41:53,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:41:53,891 WARN L477 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-04-27 21:41:53,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:41:53,929 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:41:53,929 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:53,929 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:53,929 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:41:53,930 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 13 70) the Hoare annotation is: (= |old(~__return_72~0)| ~__return_72~0) [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 69) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 70) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 68) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 70) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L895 garLoopResultBuilder]: At program point L40(lines 30 68) the Hoare annotation is: (let ((.cse1 (+ main_~main__j~0 main_~main__x~0)) (.cse0 (+ main_~main__i~0 main_~main__y~0))) (and (<= .cse0 .cse1) (= |old(~__return_72~0)| ~__return_72~0) (<= .cse1 .cse0))) [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 66) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 60) no Hoare annotation was computed. [2022-04-27 21:41:53,930 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-27 21:41:53,931 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 53) no Hoare annotation was computed. [2022-04-27 21:41:53,933 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 21:41:53,934 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:41:53,937 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:53,937 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:53,937 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:53,937 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:53,938 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:53,938 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:41:53,938 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:41:53,938 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:41:53,938 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:41:53,938 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:41:53,939 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 21:41:53,940 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:41:53,940 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 21:41:53,940 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 21:41:53,940 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 21:41:53,940 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 21:41:53,940 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 21:41:53,940 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 21:41:53,940 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:41:53,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:53 BasicIcfg [2022-04-27 21:41:53,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:41:53,948 INFO L158 Benchmark]: Toolchain (without parser) took 2524.40ms. Allocated memory was 205.5MB in the beginning and 270.5MB in the end (delta: 65.0MB). Free memory was 154.5MB in the beginning and 208.3MB in the end (delta: -53.8MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-27 21:41:53,948 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory was 170.8MB in the beginning and 170.7MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:41:53,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.09ms. Allocated memory is still 205.5MB. Free memory was 154.3MB in the beginning and 181.7MB in the end (delta: -27.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 21:41:53,949 INFO L158 Benchmark]: Boogie Preprocessor took 20.53ms. Allocated memory is still 205.5MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:41:53,949 INFO L158 Benchmark]: RCFGBuilder took 212.81ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 168.6MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:41:53,949 INFO L158 Benchmark]: IcfgTransformer took 17.96ms. Allocated memory is still 205.5MB. Free memory was 168.6MB in the beginning and 167.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:41:53,949 INFO L158 Benchmark]: TraceAbstraction took 2099.68ms. Allocated memory was 205.5MB in the beginning and 270.5MB in the end (delta: 65.0MB). Free memory was 166.5MB in the beginning and 208.3MB in the end (delta: -41.8MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2022-04-27 21:41:53,950 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory was 170.8MB in the beginning and 170.7MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.09ms. Allocated memory is still 205.5MB. Free memory was 154.3MB in the beginning and 181.7MB in the end (delta: -27.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.53ms. Allocated memory is still 205.5MB. Free memory was 181.7MB in the beginning and 180.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 212.81ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 168.6MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 17.96ms. Allocated memory is still 205.5MB. Free memory was 168.6MB in the beginning and 167.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2099.68ms. Allocated memory was 205.5MB in the beginning and 270.5MB in the end (delta: 65.0MB). Free memory was 166.5MB in the beginning and 208.3MB in the end (delta: -41.8MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 25 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 7 NumberOfFragments, 36 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 244 SizeOfPredicates, 7 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (main__i + main__y <= main__j + main__x && \old(__return_72) == __return_72) && main__j + main__x <= main__i + main__y RESULT: Ultimate proved your program to be correct! [2022-04-27 21:41:53,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...