/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/loops/nec40.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:04:38,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:04:38,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:04:38,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:04:38,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:04:38,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:04:38,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:04:38,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:04:38,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:04:38,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:04:38,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:04:38,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:04:38,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:04:38,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:04:38,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:04:38,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:04:38,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:04:38,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:04:38,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:04:38,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:04:38,408 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:04:38,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:04:38,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:04:38,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:04:38,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:04:38,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:04:38,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:04:38,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:04:38,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:04:38,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:04:38,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:04:38,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:04:38,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:04:38,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:04:38,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:04:38,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:04:38,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:04:38,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:04:38,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:04:38,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:04:38,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:04:38,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:04:38,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:04:38,446 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:04:38,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:04:38,447 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:04:38,447 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:04:38,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:04:38,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:04:38,448 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:04:38,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:04:38,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:04:38,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:04:38,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:04:38,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:04:38,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:04:38,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:04:38,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:04:38,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:04:38,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:04:38,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:04:38,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:04:38,452 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:04:38,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:04:38,454 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:04:38,454 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-15 00:04:38,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:04:38,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:04:38,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:04:38,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:04:38,674 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:04:38,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec40.c [2022-04-15 00:04:38,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f18aa4c5/b7e6d2d584594d12872ec4c31f4150e4/FLAGfd64e260c [2022-04-15 00:04:39,044 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:04:39,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c [2022-04-15 00:04:39,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f18aa4c5/b7e6d2d584594d12872ec4c31f4150e4/FLAGfd64e260c [2022-04-15 00:04:39,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f18aa4c5/b7e6d2d584594d12872ec4c31f4150e4 [2022-04-15 00:04:39,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:04:39,467 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:04:39,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:39,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:04:39,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:04:39,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308dadd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39, skipping insertion in model container [2022-04-15 00:04:39,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:04:39,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:04:39,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c[317,330] [2022-04-15 00:04:39,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:39,628 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:04:39,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40.c[317,330] [2022-04-15 00:04:39,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:39,658 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:04:39,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39 WrapperNode [2022-04-15 00:04:39,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:39,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:04:39,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:04:39,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:04:39,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:04:39,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:04:39,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:04:39,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:04:39,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:04:39,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:04:39,709 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-15 00:04:39,713 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-15 00:04:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:04:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:04:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:04:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:04:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:04:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:04:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:04:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:04:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:04:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:04:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:04:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:04:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:04:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:04:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:04:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:04:39,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:04:39,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:04:39,810 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:04:39,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:04:39,957 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:04:39,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:04:39,963 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:04:39,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:39 BoogieIcfgContainer [2022-04-15 00:04:39,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:04:39,965 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:04:39,965 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:04:39,966 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:04:39,968 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:39" (1/1) ... [2022-04-15 00:04:39,970 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:04:39,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:39 BasicIcfg [2022-04-15 00:04:39,989 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:04:39,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:04:39,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:04:39,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:04:39,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:04:39" (1/4) ... [2022-04-15 00:04:39,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6f40f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:39, skipping insertion in model container [2022-04-15 00:04:39,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:39" (2/4) ... [2022-04-15 00:04:39,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6f40f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:39, skipping insertion in model container [2022-04-15 00:04:39,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:39" (3/4) ... [2022-04-15 00:04:39,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6f40f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:04:39, skipping insertion in model container [2022-04-15 00:04:39,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:39" (4/4) ... [2022-04-15 00:04:40,000 INFO L111 eAbstractionObserver]: Analyzing ICFG nec40.cqvasr [2022-04-15 00:04:40,003 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:04:40,004 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:04:40,043 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:04:40,051 INFO L340 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 [2022-04-15 00:04:40,052 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:04:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:04:40,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:40,068 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:40,068 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:40,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -42314719, now seen corresponding path program 1 times [2022-04-15 00:04:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:40,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208151699] [2022-04-15 00:04:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:40,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_9| 1))) (and (= (select |v_#valid_1| 5) 1) (= v_~i~0_8 0) (= (select .cse0 1) 0) (= |v_~#x~0.offset_3| 0) (= (select |v_#length_1| 2) 8) (= 5 |v_~#y~0.base_4|) (= (select |v_#valid_1| 2) 1) (= |v_~#x~0.base_3| 4) (= (select |v_#valid_1| 0) 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~k~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= |v_~#y~0.offset_4| 0) (= (select |v_#length_1| 3) 12) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_9| |v_~#x~0.base_3| .cse1) |v_~#y~0.base_4| .cse1)) |v_#memory_int_7|) (= 100 (select |v_#length_1| 4)) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 5) 100) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_9|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_4, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_8, ~#x~0.offset=|v_~#x~0.offset_3|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_7|, ~#x~0.base=|v_~#x~0.base_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {26#true} is VALID [2022-04-15 00:04:40,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:04:40,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:04:40,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:40,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_9| 1))) (and (= (select |v_#valid_1| 5) 1) (= v_~i~0_8 0) (= (select .cse0 1) 0) (= |v_~#x~0.offset_3| 0) (= (select |v_#length_1| 2) 8) (= 5 |v_~#y~0.base_4|) (= (select |v_#valid_1| 2) 1) (= |v_~#x~0.base_3| 4) (= (select |v_#valid_1| 0) 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~k~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= |v_~#y~0.offset_4| 0) (= (select |v_#length_1| 3) 12) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_9| |v_~#x~0.base_3| .cse1) |v_~#y~0.base_4| .cse1)) |v_#memory_int_7|) (= 100 (select |v_#length_1| 4)) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 5) 100) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_9|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_4, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_8, ~#x~0.offset=|v_~#x~0.offset_3|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_7|, ~#x~0.base=|v_~#x~0.base_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {26#true} is VALID [2022-04-15 00:04:40,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:04:40,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:04:40,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:04:40,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [58] mainENTRY-->L20-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_~i~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_1, ~i~0=v_~i~0_1} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {26#true} is VALID [2022-04-15 00:04:40,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [60] L20-3-->L20-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:04:40,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} [62] L20-4-->L26: Formula: (= (store |v_#memory_int_5| |v_~#y~0.base_2| (store (select |v_#memory_int_5| |v_~#y~0.base_2|) (+ |v_~#y~0.offset_2| v_~i~0_5) 0)) |v_#memory_int_4|) InVars {#memory_int=|v_#memory_int_5|, ~#y~0.offset=|v_~#y~0.offset_2|, ~#y~0.base=|v_~#y~0.base_2|, ~i~0=v_~i~0_5} OutVars{#memory_int=|v_#memory_int_4|, ~#y~0.offset=|v_~#y~0.offset_2|, ~#y~0.base=|v_~#y~0.base_2|, ~i~0=v_~i~0_5} AuxVars[] AssignedVars[#memory_int] {27#false} is VALID [2022-04-15 00:04:40,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [65] L26-->L27: Formula: (and (<= 0 v_~k~0_2) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_6| |v_~#y~0.base_3|) (+ |v_~#y~0.offset_3| v_~k~0_2))) (< v_~k~0_2 v_~i~0_6)) InVars {~k~0=v_~k~0_2, #memory_int=|v_#memory_int_6|, ~#y~0.offset=|v_~#y~0.offset_3|, ~#y~0.base=|v_~#y~0.base_3|, ~i~0=v_~i~0_6} OutVars{~k~0=v_~k~0_2, ~#y~0.offset=|v_~#y~0.offset_3|, ~i~0=v_~i~0_6, #memory_int=|v_#memory_int_6|, main_#t~mem8=|v_main_#t~mem8_1|, ~#y~0.base=|v_~#y~0.base_3|} AuxVars[] AssignedVars[main_#t~mem8] {27#false} is VALID [2022-04-15 00:04:40,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [67] L27-->L28: Formula: (not (= |v_main_#t~mem8_3| 0)) InVars {main_#t~mem8=|v_main_#t~mem8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {27#false} is VALID [2022-04-15 00:04:40,260 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| 0) InVars {} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond] {27#false} is VALID [2022-04-15 00:04:40,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} [72] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-15 00:04:40,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} [73] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:04:40,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} [75] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:04:40,261 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-15 00:04:40,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:40,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208151699] [2022-04-15 00:04:40,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208151699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:40,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:40,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:04:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023833936] [2022-04-15 00:04:40,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 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 14 [2022-04-15 00:04:40,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:40,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 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-15 00:04:40,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:40,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:04:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:04:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:04:40,319 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 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-15 00:04:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:40,425 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-15 00:04:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:04:40,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 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 14 [2022-04-15 00:04:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 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-15 00:04:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-15 00:04:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 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-15 00:04:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-15 00:04:40,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-04-15 00:04:40,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:40,496 INFO L225 Difference]: With dead ends: 38 [2022-04-15 00:04:40,496 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 00:04:40,498 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:04:40,500 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:40,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 00:04:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 00:04:40,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:40,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 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-15 00:04:40,524 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 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-15 00:04:40,524 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 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-15 00:04:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:40,529 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:04:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:04:40,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:40,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:40,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 00:04:40,530 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 00:04:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:40,538 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:04:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:04:40,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:40,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:40,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:40,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 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-15 00:04:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 00:04:40,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 00:04:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:40,551 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 00:04:40,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 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-15 00:04:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:04:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:04:40,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:40,552 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:40,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:04:40,553 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash 195966441, now seen corresponding path program 1 times [2022-04-15 00:04:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:40,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121845951] [2022-04-15 00:04:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:40,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:40,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {142#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_9| 1))) (and (= (select |v_#valid_1| 5) 1) (= v_~i~0_8 0) (= (select .cse0 1) 0) (= |v_~#x~0.offset_3| 0) (= (select |v_#length_1| 2) 8) (= 5 |v_~#y~0.base_4|) (= (select |v_#valid_1| 2) 1) (= |v_~#x~0.base_3| 4) (= (select |v_#valid_1| 0) 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~k~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= |v_~#y~0.offset_4| 0) (= (select |v_#length_1| 3) 12) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_9| |v_~#x~0.base_3| .cse1) |v_~#y~0.base_4| .cse1)) |v_#memory_int_7|) (= 100 (select |v_#length_1| 4)) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 5) 100) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_9|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_4, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_8, ~#x~0.offset=|v_~#x~0.offset_3|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_7|, ~#x~0.base=|v_~#x~0.base_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {136#true} is VALID [2022-04-15 00:04:40,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-15 00:04:40,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-15 00:04:40,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {142#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:40,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_9| 1))) (and (= (select |v_#valid_1| 5) 1) (= v_~i~0_8 0) (= (select .cse0 1) 0) (= |v_~#x~0.offset_3| 0) (= (select |v_#length_1| 2) 8) (= 5 |v_~#y~0.base_4|) (= (select |v_#valid_1| 2) 1) (= |v_~#x~0.base_3| 4) (= (select |v_#valid_1| 0) 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~k~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= |v_~#y~0.offset_4| 0) (= (select |v_#length_1| 3) 12) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_9| |v_~#x~0.base_3| .cse1) |v_~#y~0.base_4| .cse1)) |v_#memory_int_7|) (= 100 (select |v_#length_1| 4)) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 5) 100) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_9|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_4, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_8, ~#x~0.offset=|v_~#x~0.offset_3|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_7|, ~#x~0.base=|v_~#x~0.base_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {136#true} is VALID [2022-04-15 00:04:40,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-15 00:04:40,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-15 00:04:40,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-15 00:04:40,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} [58] mainENTRY-->L20-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_~i~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_1, ~i~0=v_~i~0_1} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {141#(= ~i~0 0)} is VALID [2022-04-15 00:04:40,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#(= ~i~0 0)} [61] L20-3-->L20-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_~#x~0.base_1|) (+ |v_~#x~0.offset_1| v_~i~0_2))) InVars {~#x~0.base=|v_~#x~0.base_1|, #memory_int=|v_#memory_int_1|, ~#x~0.offset=|v_~#x~0.offset_1|, ~i~0=v_~i~0_2} OutVars{~#x~0.base=|v_~#x~0.base_1|, #memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_1|, ~i~0=v_~i~0_2} AuxVars[] AssignedVars[main_#t~mem5] {141#(= ~i~0 0)} is VALID [2022-04-15 00:04:40,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#(= ~i~0 0)} [63] L20-1-->L20-4: Formula: (= |v_main_#t~mem5_3| 0) InVars {main_#t~mem5=|v_main_#t~mem5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem5] {141#(= ~i~0 0)} is VALID [2022-04-15 00:04:40,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#(= ~i~0 0)} [62] L20-4-->L26: Formula: (= (store |v_#memory_int_5| |v_~#y~0.base_2| (store (select |v_#memory_int_5| |v_~#y~0.base_2|) (+ |v_~#y~0.offset_2| v_~i~0_5) 0)) |v_#memory_int_4|) InVars {#memory_int=|v_#memory_int_5|, ~#y~0.offset=|v_~#y~0.offset_2|, ~#y~0.base=|v_~#y~0.base_2|, ~i~0=v_~i~0_5} OutVars{#memory_int=|v_#memory_int_4|, ~#y~0.offset=|v_~#y~0.offset_2|, ~#y~0.base=|v_~#y~0.base_2|, ~i~0=v_~i~0_5} AuxVars[] AssignedVars[#memory_int] {141#(= ~i~0 0)} is VALID [2022-04-15 00:04:40,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#(= ~i~0 0)} [65] L26-->L27: Formula: (and (<= 0 v_~k~0_2) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_6| |v_~#y~0.base_3|) (+ |v_~#y~0.offset_3| v_~k~0_2))) (< v_~k~0_2 v_~i~0_6)) InVars {~k~0=v_~k~0_2, #memory_int=|v_#memory_int_6|, ~#y~0.offset=|v_~#y~0.offset_3|, ~#y~0.base=|v_~#y~0.base_3|, ~i~0=v_~i~0_6} OutVars{~k~0=v_~k~0_2, ~#y~0.offset=|v_~#y~0.offset_3|, ~i~0=v_~i~0_6, #memory_int=|v_#memory_int_6|, main_#t~mem8=|v_main_#t~mem8_1|, ~#y~0.base=|v_~#y~0.base_3|} AuxVars[] AssignedVars[main_#t~mem8] {137#false} is VALID [2022-04-15 00:04:40,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#false} [67] L27-->L28: Formula: (not (= |v_main_#t~mem8_3| 0)) InVars {main_#t~mem8=|v_main_#t~mem8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {137#false} is VALID [2022-04-15 00:04:40,664 INFO L272 TraceCheckUtils]: 11: Hoare triple {137#false} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| 0) InVars {} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond] {137#false} is VALID [2022-04-15 00:04:40,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {137#false} [72] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {137#false} is VALID [2022-04-15 00:04:40,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {137#false} [73] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {137#false} is VALID [2022-04-15 00:04:40,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {137#false} [75] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {137#false} is VALID [2022-04-15 00:04:40,665 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-15 00:04:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:40,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121845951] [2022-04-15 00:04:40,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121845951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:40,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:40,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:04:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146664120] [2022-04-15 00:04:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 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 15 [2022-04-15 00:04:40,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:40,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 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-15 00:04:40,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:40,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:04:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:04:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:04:40,682 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 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-15 00:04:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:40,767 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 00:04:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:04:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 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 15 [2022-04-15 00:04:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 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-15 00:04:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 00:04:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 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-15 00:04:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 00:04:40,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-15 00:04:40,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:40,803 INFO L225 Difference]: With dead ends: 26 [2022-04-15 00:04:40,804 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 00:04:40,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:04:40,806 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:40,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 00:04:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 00:04:40,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:40,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 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-15 00:04:40,811 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 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-15 00:04:40,811 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 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-15 00:04:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:40,812 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:04:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:04:40,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:40,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:40,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 00:04:40,812 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 00:04:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:40,813 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:04:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:04:40,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:40,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:40,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:40,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 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-15 00:04:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 00:04:40,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-15 00:04:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:40,815 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 00:04:40,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 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-15 00:04:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:04:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:04:40,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:40,816 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:40,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:04:40,816 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1475071974, now seen corresponding path program 1 times [2022-04-15 00:04:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556938568] [2022-04-15 00:04:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:41,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_9| 1))) (and (= (select |v_#valid_1| 5) 1) (= v_~i~0_8 0) (= (select .cse0 1) 0) (= |v_~#x~0.offset_3| 0) (= (select |v_#length_1| 2) 8) (= 5 |v_~#y~0.base_4|) (= (select |v_#valid_1| 2) 1) (= |v_~#x~0.base_3| 4) (= (select |v_#valid_1| 0) 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~k~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= |v_~#y~0.offset_4| 0) (= (select |v_#length_1| 3) 12) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_9| |v_~#x~0.base_3| .cse1) |v_~#y~0.base_4| .cse1)) |v_#memory_int_7|) (= 100 (select |v_#length_1| 4)) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 5) 100) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_9|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_4, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_8, ~#x~0.offset=|v_~#x~0.offset_3|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_7|, ~#x~0.base=|v_~#x~0.base_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} {245#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:41,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#(and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [56] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_9| 1))) (and (= (select |v_#valid_1| 5) 1) (= v_~i~0_8 0) (= (select .cse0 1) 0) (= |v_~#x~0.offset_3| 0) (= (select |v_#length_1| 2) 8) (= 5 |v_~#y~0.base_4|) (= (select |v_#valid_1| 2) 1) (= |v_~#x~0.base_3| 4) (= (select |v_#valid_1| 0) 0) (= v_~j~0_1 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~k~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= |v_~#y~0.offset_4| 0) (= (select |v_#length_1| 3) 12) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store (store |v_#memory_int_9| |v_~#x~0.base_3| .cse1) |v_~#y~0.base_4| .cse1)) |v_#memory_int_7|) (= 100 (select |v_#length_1| 4)) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 5) 100) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= 48 (select .cse0 0)))) InVars {#memory_int=|v_#memory_int_9|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~k~0=v_~k~0_4, ~j~0=v_~j~0_1, ~#y~0.offset=|v_~#y~0.offset_4|, ~i~0=v_~i~0_8, ~#x~0.offset=|v_~#x~0.offset_3|, #NULL.offset=|v_#NULL.offset_1|, ~#y~0.base=|v_~#y~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_7|, ~#x~0.base=|v_~#x~0.base_3|, #length=|v_#length_1|} AuxVars[] AssignedVars[~k~0, ~j~0, ~#y~0.offset, ~i~0, ~#x~0.offset, #memory_int, ~#x~0.base, #NULL.offset, ~#y~0.base, #NULL.base] {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} {245#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)))} [58] mainENTRY-->L20-3: Formula: (and (= |v_main_#t~nondet4_2| v_~k~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_~i~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~k~0=v_~k~0_1, ~i~0=v_~i~0_1} AuxVars[] AssignedVars[~k~0, main_#t~nondet4, ~i~0] {251#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)))} is VALID [2022-04-15 00:04:41,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)))} [61] L20-3-->L20-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_~#x~0.base_1|) (+ |v_~#x~0.offset_1| v_~i~0_2))) InVars {~#x~0.base=|v_~#x~0.base_1|, #memory_int=|v_#memory_int_1|, ~#x~0.offset=|v_~#x~0.offset_1|, ~i~0=v_~i~0_2} OutVars{~#x~0.base=|v_~#x~0.base_1|, #memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_1|, ~i~0=v_~i~0_2} AuxVars[] AssignedVars[main_#t~mem5] {252#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0))} is VALID [2022-04-15 00:04:41,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {252#(and (= (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|)) 0) (not (= |~#x~0.base| |~#y~0.base|)) (= |main_#t~mem5| 0))} [64] L20-1-->L20-3: Formula: (and (not (= |v_main_#t~mem5_5| 0)) (= (+ v_~i~0_4 1) v_~i~0_3) (= (store |v_#memory_int_3| |v_~#y~0.base_1| (store (select |v_#memory_int_3| |v_~#y~0.base_1|) (+ |v_~#y~0.offset_1| v_~i~0_4) (select (select |v_#memory_int_3| |v_~#x~0.base_2|) (+ |v_~#x~0.offset_2| v_~i~0_4)))) |v_#memory_int_2|)) InVars {~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_4, ~#x~0.offset=|v_~#x~0.offset_2|, #memory_int=|v_#memory_int_3|, ~#x~0.base=|v_~#x~0.base_2|, main_#t~mem5=|v_main_#t~mem5_5|, ~#y~0.base=|v_~#y~0.base_1|} OutVars{~#y~0.offset=|v_~#y~0.offset_1|, ~i~0=v_~i~0_3, ~#x~0.offset=|v_~#x~0.offset_2|, #memory_int=|v_#memory_int_2|, ~#x~0.base=|v_~#x~0.base_2|, main_#t~mem6=|v_main_#t~mem6_1|, ~#y~0.base=|v_~#y~0.base_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~i~0, #memory_int, main_#t~mem5, main_#t~mem6, main_#t~post7] {246#false} is VALID [2022-04-15 00:04:41,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#false} [61] L20-3-->L20-1: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_~#x~0.base_1|) (+ |v_~#x~0.offset_1| v_~i~0_2))) InVars {~#x~0.base=|v_~#x~0.base_1|, #memory_int=|v_#memory_int_1|, ~#x~0.offset=|v_~#x~0.offset_1|, ~i~0=v_~i~0_2} OutVars{~#x~0.base=|v_~#x~0.base_1|, #memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, ~#x~0.offset=|v_~#x~0.offset_1|, ~i~0=v_~i~0_2} AuxVars[] AssignedVars[main_#t~mem5] {246#false} is VALID [2022-04-15 00:04:41,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#false} [63] L20-1-->L20-4: Formula: (= |v_main_#t~mem5_3| 0) InVars {main_#t~mem5=|v_main_#t~mem5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem5] {246#false} is VALID [2022-04-15 00:04:41,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {246#false} [62] L20-4-->L26: Formula: (= (store |v_#memory_int_5| |v_~#y~0.base_2| (store (select |v_#memory_int_5| |v_~#y~0.base_2|) (+ |v_~#y~0.offset_2| v_~i~0_5) 0)) |v_#memory_int_4|) InVars {#memory_int=|v_#memory_int_5|, ~#y~0.offset=|v_~#y~0.offset_2|, ~#y~0.base=|v_~#y~0.base_2|, ~i~0=v_~i~0_5} OutVars{#memory_int=|v_#memory_int_4|, ~#y~0.offset=|v_~#y~0.offset_2|, ~#y~0.base=|v_~#y~0.base_2|, ~i~0=v_~i~0_5} AuxVars[] AssignedVars[#memory_int] {246#false} is VALID [2022-04-15 00:04:41,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#false} [65] L26-->L27: Formula: (and (<= 0 v_~k~0_2) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_6| |v_~#y~0.base_3|) (+ |v_~#y~0.offset_3| v_~k~0_2))) (< v_~k~0_2 v_~i~0_6)) InVars {~k~0=v_~k~0_2, #memory_int=|v_#memory_int_6|, ~#y~0.offset=|v_~#y~0.offset_3|, ~#y~0.base=|v_~#y~0.base_3|, ~i~0=v_~i~0_6} OutVars{~k~0=v_~k~0_2, ~#y~0.offset=|v_~#y~0.offset_3|, ~i~0=v_~i~0_6, #memory_int=|v_#memory_int_6|, main_#t~mem8=|v_main_#t~mem8_1|, ~#y~0.base=|v_~#y~0.base_3|} AuxVars[] AssignedVars[main_#t~mem8] {246#false} is VALID [2022-04-15 00:04:41,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#false} [67] L27-->L28: Formula: (not (= |v_main_#t~mem8_3| 0)) InVars {main_#t~mem8=|v_main_#t~mem8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem8] {246#false} is VALID [2022-04-15 00:04:41,013 INFO L272 TraceCheckUtils]: 13: Hoare triple {246#false} [70] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| 0) InVars {} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond] {246#false} is VALID [2022-04-15 00:04:41,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#false} [72] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {246#false} is VALID [2022-04-15 00:04:41,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#false} [73] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-15 00:04:41,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#false} [75] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-15 00:04:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:04:41,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556938568] [2022-04-15 00:04:41,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556938568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:41,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:41,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:04:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271267870] [2022-04-15 00:04:41,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:41,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 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 17 [2022-04-15 00:04:41,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:41,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 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-15 00:04:41,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:41,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:04:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:04:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:04:41,036 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 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-15 00:04:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:41,099 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:04:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:04:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 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 17 [2022-04-15 00:04:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 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-15 00:04:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 00:04:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 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-15 00:04:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 00:04:41,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-15 00:04:41,115 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-15 00:04:41,115 INFO L225 Difference]: With dead ends: 18 [2022-04-15 00:04:41,115 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:04:41,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:04:41,116 INFO L913 BasicCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:41,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:04:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:04:41,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:41,117 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-15 00:04:41,117 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-15 00:04:41,117 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-15 00:04:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:41,118 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:04:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:04:41,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:41,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:41,118 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-15 00:04:41,118 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-15 00:04:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:41,118 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:04:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:04:41,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:41,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:41,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:41,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:41,119 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-15 00:04:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:04:41,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 00:04:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:41,119 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:04:41,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 3 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-15 00:04:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:04:41,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:41,121 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:04:41,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:04:41,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:04:41,194 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~i~0 |old(~i~0)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#y~0.offset)| |~#y~0.offset|) (= ~k~0 |old(~k~0)|) (= |old(~#y~0.base)| |~#y~0.base|) (= |~#x~0.base| |old(~#x~0.base)|) (= ~j~0 |old(~j~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:04:41,194 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:04:41,194 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:04:41,194 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:04:41,195 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) (not (= |~#x~0.base| |~#y~0.base|)) (= ~i~0 0)) [2022-04-15 00:04:41,195 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:04:41,195 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:04:41,195 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 31) the Hoare annotation is: (or (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)) (and (= ~i~0 0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|))) [2022-04-15 00:04:41,195 INFO L878 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= .cse0 (select |#memory_int| |~#x~0.base|)) (= ~i~0 0)) (= |~#x~0.base| |~#y~0.base|) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0)))) [2022-04-15 00:04:41,195 INFO L882 garLoopResultBuilder]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2022-04-15 00:04:41,195 INFO L882 garLoopResultBuilder]: For program point L20-1(lines 20 23) no Hoare annotation was computed. [2022-04-15 00:04:41,195 INFO L882 garLoopResultBuilder]: For program point L26(lines 26 28) no Hoare annotation was computed. [2022-04-15 00:04:41,195 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 28) no Hoare annotation was computed. [2022-04-15 00:04:41,195 INFO L882 garLoopResultBuilder]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2022-04-15 00:04:41,195 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= |old(~i~0)| 0))) [2022-04-15 00:04:41,196 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 31) no Hoare annotation was computed. [2022-04-15 00:04:41,196 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 31) no Hoare annotation was computed. [2022-04-15 00:04:41,196 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 00:04:41,196 INFO L882 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-15 00:04:41,196 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 00:04:41,196 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:04:41,196 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-15 00:04:41,196 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:04:41,198 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-15 00:04:41,199 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:04:41,205 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:04:41,206 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:04:41,207 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:04:41,207 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:04:41,210 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:444) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 00:04:41,216 INFO L158 Benchmark]: Toolchain (without parser) took 1748.53ms. Allocated memory was 188.7MB in the beginning and 227.5MB in the end (delta: 38.8MB). Free memory was 136.5MB in the beginning and 165.5MB in the end (delta: -29.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-15 00:04:41,217 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:04:41,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.55ms. Allocated memory is still 188.7MB. Free memory was 136.2MB in the beginning and 164.6MB in the end (delta: -28.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:04:41,217 INFO L158 Benchmark]: Boogie Preprocessor took 20.33ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 162.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:04:41,217 INFO L158 Benchmark]: RCFGBuilder took 280.59ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 151.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:04:41,217 INFO L158 Benchmark]: IcfgTransformer took 24.03ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:04:41,218 INFO L158 Benchmark]: TraceAbstraction took 1224.72ms. Allocated memory was 188.7MB in the beginning and 227.5MB in the end (delta: 38.8MB). Free memory was 149.0MB in the beginning and 165.5MB in the end (delta: -16.6MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2022-04-15 00:04:41,219 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.13ms. Allocated memory is still 188.7MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.55ms. Allocated memory is still 188.7MB. Free memory was 136.2MB in the beginning and 164.6MB in the end (delta: -28.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.33ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 162.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.59ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 151.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 24.03ms. Allocated memory is still 188.7MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1224.72ms. Allocated memory was 188.7MB in the beginning and 227.5MB in the end (delta: 38.8MB). Free memory was 149.0MB in the beginning and 165.5MB in the end (delta: -16.6MB). Peak memory consumption was 23.7MB. 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: 7]: 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 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 41 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 10 NumberOfFragments, 112 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 00:04:41,253 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...