./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:56:43,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:56:43,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:56:43,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:56:43,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:56:43,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:56:43,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:56:43,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:56:43,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:56:43,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:56:43,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:56:43,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:56:43,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:56:43,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:56:43,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:56:43,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:56:43,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:56:43,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:56:43,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:56:43,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:56:43,649 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:56:43,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:56:43,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:56:43,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:56:43,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:56:43,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:56:43,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:56:43,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:56:43,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:56:43,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:56:43,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:56:43,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:56:43,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:56:43,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:56:43,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:56:43,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:56:43,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:56:43,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:56:43,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:56:43,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:56:43,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:56:43,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:56:43,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:56:43,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:56:43,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:56:43,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:56:43,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:56:43,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:56:43,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:56:43,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:56:43,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:56:43,690 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:56:43,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:56:43,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:56:43,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:56:43,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:56:43,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:56:43,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:56:43,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:56:43,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:56:43,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:56:43,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:56:43,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:56:43,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:56:43,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:56:43,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:56:43,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:56:43,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:56:43,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:56:43,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:56:43,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:56:43,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:56:43,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:56:43,695 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:56:43,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:56:43,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:56:43,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2022-07-13 15:56:43,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:56:43,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:56:43,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:56:43,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:56:43,937 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:56:43,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2022-07-13 15:56:43,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ea77bd55/9bc9fcafde4041739247a26b65a44786/FLAGfd74d42a6 [2022-07-13 15:56:44,308 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:56:44,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2022-07-13 15:56:44,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ea77bd55/9bc9fcafde4041739247a26b65a44786/FLAGfd74d42a6 [2022-07-13 15:56:44,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ea77bd55/9bc9fcafde4041739247a26b65a44786 [2022-07-13 15:56:44,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:56:44,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:56:44,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:56:44,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:56:44,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:56:44,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502a4c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44, skipping insertion in model container [2022-07-13 15:56:44,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:56:44,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:56:44,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-07-13 15:56:44,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:56:44,874 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:56:44,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-07-13 15:56:44,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:56:44,896 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:56:44,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44 WrapperNode [2022-07-13 15:56:44,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:56:44,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:56:44,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:56:44,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:56:44,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,932 INFO L137 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2022-07-13 15:56:44,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:56:44,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:56:44,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:56:44,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:56:44,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:56:44,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:56:44,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:56:44,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:56:44,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (1/1) ... [2022-07-13 15:56:44,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:56:44,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:56:44,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:56:44,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:56:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:56:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 15:56:45,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 15:56:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:56:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:56:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:56:45,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:56:45,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:56:45,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 15:56:45,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 15:56:45,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:56:45,067 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:56:45,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:56:45,238 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:56:45,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:56:45,243 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 15:56:45,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:56:45 BoogieIcfgContainer [2022-07-13 15:56:45,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:56:45,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:56:45,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:56:45,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:56:45,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:56:44" (1/3) ... [2022-07-13 15:56:45,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5f7907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:56:45, skipping insertion in model container [2022-07-13 15:56:45,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:44" (2/3) ... [2022-07-13 15:56:45,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5f7907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:56:45, skipping insertion in model container [2022-07-13 15:56:45,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:56:45" (3/3) ... [2022-07-13 15:56:45,250 INFO L111 eAbstractionObserver]: Analyzing ICFG lcp.c [2022-07-13 15:56:45,259 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:56:45,263 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:56:45,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:56:45,317 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@488c7d16, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@dbc52a9 [2022-07-13 15:56:45,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:56:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:56:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:56:45,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:45,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:45,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:45,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash 867982546, now seen corresponding path program 1 times [2022-07-13 15:56:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:45,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066632094] [2022-07-13 15:56:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:45,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 15:56:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 15:56:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:56:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:45,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066632094] [2022-07-13 15:56:45,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066632094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:45,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:45,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:56:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347582343] [2022-07-13 15:56:45,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:45,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:56:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:56:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:56:45,484 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:56:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:45,499 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-07-13 15:56:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:56:45,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-13 15:56:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:45,507 INFO L225 Difference]: With dead ends: 63 [2022-07-13 15:56:45,507 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 15:56:45,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:56:45,512 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:45,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:56:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 15:56:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-13 15:56:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-13 15:56:45,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2022-07-13 15:56:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:45,564 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-13 15:56:45,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:56:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-13 15:56:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:56:45,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:45,565 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:45,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:56:45,566 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1785702985, now seen corresponding path program 1 times [2022-07-13 15:56:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:45,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192203548] [2022-07-13 15:56:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:45,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 15:56:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:56:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:56:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192203548] [2022-07-13 15:56:45,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192203548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:45,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:45,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:56:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464238947] [2022-07-13 15:56:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:45,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:56:45,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:45,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:56:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:56:45,750 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:56:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:45,895 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-07-13 15:56:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:56:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-07-13 15:56:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:45,900 INFO L225 Difference]: With dead ends: 58 [2022-07-13 15:56:45,900 INFO L226 Difference]: Without dead ends: 40 [2022-07-13 15:56:45,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:56:45,904 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:45,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:56:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-13 15:56:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-07-13 15:56:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-13 15:56:45,914 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 30 [2022-07-13 15:56:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:45,915 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-13 15:56:45,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:56:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-13 15:56:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:56:45,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:45,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:45,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:56:45,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 774585735, now seen corresponding path program 1 times [2022-07-13 15:56:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:45,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140210685] [2022-07-13 15:56:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 15:56:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:56:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:56:46,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:46,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140210685] [2022-07-13 15:56:46,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140210685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:46,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:46,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 15:56:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875263288] [2022-07-13 15:56:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:46,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:56:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:56:46,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:56:46,060 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:56:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:46,174 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-07-13 15:56:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:56:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-07-13 15:56:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:46,175 INFO L225 Difference]: With dead ends: 37 [2022-07-13 15:56:46,175 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 15:56:46,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:56:46,177 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:46,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:56:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 15:56:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-13 15:56:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-13 15:56:46,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 30 [2022-07-13 15:56:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:46,201 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-13 15:56:46,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 15:56:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-13 15:56:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:56:46,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:46,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:46,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:56:46,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2142420270, now seen corresponding path program 1 times [2022-07-13 15:56:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:46,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463245568] [2022-07-13 15:56:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 15:56:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 15:56:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 15:56:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:56:46,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:46,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463245568] [2022-07-13 15:56:46,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463245568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:46,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:46,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:56:46,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271056882] [2022-07-13 15:56:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:46,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:56:46,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:46,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:56:46,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:56:46,401 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 15:56:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:46,561 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-13 15:56:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:56:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-13 15:56:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:46,564 INFO L225 Difference]: With dead ends: 46 [2022-07-13 15:56:46,564 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:56:46,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:56:46,571 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:46,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:56:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:56:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-13 15:56:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-13 15:56:46,579 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 37 [2022-07-13 15:56:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:46,579 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-13 15:56:46,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 15:56:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-13 15:56:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:56:46,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:46,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:46,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:56:46,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 874062527, now seen corresponding path program 1 times [2022-07-13 15:56:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:46,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487775635] [2022-07-13 15:56:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 15:56:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:56:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 15:56:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:56:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487775635] [2022-07-13 15:56:46,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487775635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:56:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620122444] [2022-07-13 15:56:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:46,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:56:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:56:46,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:56:46,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:56:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:46,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 15:56:46,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:56:46,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:56:48,824 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|))) is different from true [2022-07-13 15:56:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 15:56:48,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:56:53,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620122444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:56:53,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:56:53,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-07-13 15:56:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217184221] [2022-07-13 15:56:53,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:56:53,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:56:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:56:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=54, Unknown=2, NotChecked=14, Total=90 [2022-07-13 15:56:53,007 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 15:56:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:53,075 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-07-13 15:56:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:56:53,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 40 [2022-07-13 15:56:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:53,077 INFO L225 Difference]: With dead ends: 59 [2022-07-13 15:56:53,077 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 15:56:53,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=41, Invalid=93, Unknown=2, NotChecked=20, Total=156 [2022-07-13 15:56:53,078 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:53,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 84 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2022-07-13 15:56:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 15:56:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-13 15:56:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-07-13 15:56:53,083 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 40 [2022-07-13 15:56:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:53,083 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-07-13 15:56:53,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 15:56:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-07-13 15:56:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:56:53,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:53,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:53,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:56:53,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:56:53,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1296764353, now seen corresponding path program 1 times [2022-07-13 15:56:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:56:53,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622912131] [2022-07-13 15:56:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:56:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 15:56:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 15:56:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 15:56:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 15:56:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 15:56:53,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:56:53,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622912131] [2022-07-13 15:56:53,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622912131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:56:53,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690555249] [2022-07-13 15:56:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:53,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:56:53,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:56:53,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:56:53,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:56:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:53,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 15:56:53,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:56:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 15:56:53,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:56:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 15:56:53,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690555249] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:56:53,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:56:53,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-13 15:56:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814416109] [2022-07-13 15:56:53,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:56:53,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:56:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:56:53,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:56:53,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:56:53,870 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 15:56:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:53,971 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-07-13 15:56:53,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:56:53,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-13 15:56:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:53,972 INFO L225 Difference]: With dead ends: 40 [2022-07-13 15:56:53,972 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 15:56:53,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:56:53,973 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:53,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 105 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:56:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 15:56:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 15:56:53,974 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-07-13 15:56:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 15:56:53,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2022-07-13 15:56:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:53,975 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 15:56:53,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 15:56:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 15:56:53,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 15:56:53,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:56:54,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:56:54,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 15:56:54,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 15:56:54,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 15:56:54,525 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-07-13 15:56:54,525 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)) (.cse10 (* |ULTIMATE.start_check_~i~0#1| 4)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|)) (.cse1 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= (select .cse9 (+ |ULTIMATE.start_check_~a#1.offset| (* 4 |ULTIMATE.start_check_~x#1|) .cse10)) 0)) (.cse4 (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|)) (.cse5 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))) (.cse6 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|)) (.cse7 (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|)))) (.cse8 (= (select .cse9 (+ (* 4 |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~a#1.offset| .cse10)) 0))) (or (and (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|))) .cse0 .cse1 (or (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|)) (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|))) (= .cse2 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= |ULTIMATE.start_check_~l#1| 0) .cse1 (or (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~x#1|) (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~y#1|)) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_lcp_~l~0#1| 0) .cse7 .cse8 (= |ULTIMATE.start_lcp_#res#1| 0))))) [2022-07-13 15:56:54,525 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-07-13 15:56:54,525 INFO L895 garLoopResultBuilder]: At program point L21(lines 16 22) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|)) (.cse1 (= .cse6 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|)) (.cse3 (= .cse6 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))) (.cse4 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|)) (.cse5 (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_lcp_~l~0#1| 0) .cse5 (= |ULTIMATE.start_lcp_#res#1| 0)) (and (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|))) .cse0 .cse1 (= .cse6 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) .cse2 .cse3 .cse4 .cse5)))) [2022-07-13 15:56:54,525 INFO L902 garLoopResultBuilder]: At program point L48(lines 35 49) the Hoare annotation is: true [2022-07-13 15:56:54,525 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-07-13 15:56:54,525 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-07-13 15:56:54,525 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: false [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 15:56:54,526 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)) (.cse11 (* |ULTIMATE.start_check_~i~0#1| 4)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|)) (.cse1 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (= (select .cse10 (+ |ULTIMATE.start_check_~a#1.offset| (* 4 |ULTIMATE.start_check_~x#1|) .cse11)) 0)) (.cse4 (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|)) (.cse5 (= .cse2 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))) (.cse6 (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_#t~mem10#1|)) (.cse7 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|)) (.cse8 (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|)))) (.cse9 (= (select .cse10 (+ (* 4 |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~a#1.offset| .cse11)) 0))) (or (and (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|))) .cse0 .cse1 (or (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|)) (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|))) (= .cse2 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= |ULTIMATE.start_check_~l#1| 0) .cse1 (or (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~x#1|) (<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~y#1|)) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_lcp_~l~0#1| 0) .cse8 .cse9 (= |ULTIMATE.start_lcp_#res#1| 0))))) [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 33) no Hoare annotation was computed. [2022-07-13 15:56:54,526 INFO L899 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L895 garLoopResultBuilder]: At program point L18-5(lines 18 20) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (<= |ULTIMATE.start_lcp_~x#1| |ULTIMATE.start_main_~x~0#1|) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|))) [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)))) [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 14) the Hoare annotation is: true [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point L13-3(lines 12 14) no Hoare annotation was computed. [2022-07-13 15:56:54,527 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 14) no Hoare annotation was computed. [2022-07-13 15:56:54,528 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-07-13 15:56:54,530 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-13 15:56:54,531 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:56:54,534 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:263) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) 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.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:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-07-13 15:56:54,537 INFO L158 Benchmark]: Toolchain (without parser) took 9805.67ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 60.6MB in the beginning and 51.6MB in the end (delta: 9.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-07-13 15:56:54,537 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:56:54,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.89ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 70.0MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:56:54,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.09ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:56:54,538 INFO L158 Benchmark]: Boogie Preprocessor took 21.91ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 66.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:56:54,538 INFO L158 Benchmark]: RCFGBuilder took 288.61ms. Allocated memory is still 94.4MB. Free memory was 66.8MB in the beginning and 54.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 15:56:54,538 INFO L158 Benchmark]: TraceAbstraction took 9291.00ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 54.2MB in the beginning and 51.6MB in the end (delta: 2.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-07-13 15:56:54,539 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 72.7MB in the beginning and 72.7MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.89ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 70.0MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.09ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.91ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 66.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.61ms. Allocated memory is still 94.4MB. Free memory was 66.8MB in the beginning and 54.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9291.00ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 54.2MB in the beginning and 51.6MB in the end (delta: 2.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * 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: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 43 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 165 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 26 PreInvPairs, 37 NumberOfFragments, 476 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 444 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 316 ConstructedInterpolants, 4 QuantifiedInterpolants, 1221 SizeOfPredicates, 33 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 125/135 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:263) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:56:54,567 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:56:56,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:56:56,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:56:56,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:56:56,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:56:56,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:56:56,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:56:56,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:56:56,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:56:56,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:56:56,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:56:56,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:56:56,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:56:56,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:56:56,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:56:56,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:56:56,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:56:56,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:56:56,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:56:56,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:56:56,342 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:56:56,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:56:56,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:56:56,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:56:56,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:56:56,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:56:56,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:56:56,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:56:56,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:56:56,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:56:56,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:56:56,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:56:56,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:56:56,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:56:56,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:56:56,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:56:56,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:56:56,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:56:56,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:56:56,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:56:56,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:56:56,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:56:56,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:56:56,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:56:56,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:56:56,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:56:56,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:56:56,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:56:56,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:56:56,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:56:56,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:56:56,392 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:56:56,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:56:56,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:56:56,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:56:56,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:56:56,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:56:56,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:56:56,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:56:56,394 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:56:56,394 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:56:56,394 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:56:56,394 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:56:56,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:56:56,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:56:56,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:56:56,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:56:56,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:56:56,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:56:56,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:56:56,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:56:56,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:56:56,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:56:56,396 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:56:56,396 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:56:56,396 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:56:56,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:56:56,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:56:56,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:56:56,397 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2022-07-13 15:56:56,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:56:56,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:56:56,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:56:56,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:56:56,640 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:56:56,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/lcp.c [2022-07-13 15:56:56,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3def0fe8e/cfdff07e880f41219b93dc405d991d6b/FLAGbb747dcd4 [2022-07-13 15:56:57,045 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:56:57,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c [2022-07-13 15:56:57,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3def0fe8e/cfdff07e880f41219b93dc405d991d6b/FLAGbb747dcd4 [2022-07-13 15:56:57,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3def0fe8e/cfdff07e880f41219b93dc405d991d6b [2022-07-13 15:56:57,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:56:57,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:56:57,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:56:57,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:56:57,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:56:57,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2abc13b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57, skipping insertion in model container [2022-07-13 15:56:57,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:56:57,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:56:57,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-07-13 15:56:57,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:56:57,330 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:56:57,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-07-13 15:56:57,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:56:57,372 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:56:57,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57 WrapperNode [2022-07-13 15:56:57,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:56:57,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:56:57,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:56:57,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:56:57,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,416 INFO L137 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2022-07-13 15:56:57,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:56:57,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:56:57,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:56:57,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:56:57,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:56:57,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:56:57,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:56:57,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:56:57,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (1/1) ... [2022-07-13 15:56:57,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:56:57,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:56:57,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:56:57,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:56:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:56:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:56:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 15:56:57,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 15:56:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:56:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 15:56:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:56:57,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:56:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 15:56:57,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 15:56:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:56:57,611 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:56:57,612 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:56:57,793 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:56:57,797 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:56:57,797 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 15:56:57,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:56:57 BoogieIcfgContainer [2022-07-13 15:56:57,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:56:57,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:56:57,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:56:57,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:56:57,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:56:57" (1/3) ... [2022-07-13 15:56:57,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30af8449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:56:57, skipping insertion in model container [2022-07-13 15:56:57,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:56:57" (2/3) ... [2022-07-13 15:56:57,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30af8449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:56:57, skipping insertion in model container [2022-07-13 15:56:57,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:56:57" (3/3) ... [2022-07-13 15:56:57,803 INFO L111 eAbstractionObserver]: Analyzing ICFG lcp.c [2022-07-13 15:56:57,812 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:56:57,812 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:56:57,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:56:57,848 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@697f92d7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@436fb8af [2022-07-13 15:56:57,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:56:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:56:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 15:56:57,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:57,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:57,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash 867982546, now seen corresponding path program 1 times [2022-07-13 15:56:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:56:57,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371419390] [2022-07-13 15:56:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:57,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:56:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:56:57,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:56:57,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:56:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:57,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:56:57,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:56:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 15:56:57,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:56:57,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:56:57,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371419390] [2022-07-13 15:56:57,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371419390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:57,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:57,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:56:57,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128439971] [2022-07-13 15:56:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:57,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:56:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:56:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:56:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:56:57,998 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:56:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:58,010 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-07-13 15:56:58,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:56:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-13 15:56:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:58,015 INFO L225 Difference]: With dead ends: 63 [2022-07-13 15:56:58,016 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 15:56:58,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:56:58,022 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:58,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:56:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 15:56:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-13 15:56:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-13 15:56:58,051 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2022-07-13 15:56:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:58,051 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-13 15:56:58,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:56:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-13 15:56:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:56:58,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:58,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:58,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:56:58,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:56:58,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1785702985, now seen corresponding path program 1 times [2022-07-13 15:56:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:56:58,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079663352] [2022-07-13 15:56:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:58,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:56:58,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:56:58,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:56:58,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:56:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:58,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:56:58,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:56:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:56:58,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:56:58,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:56:58,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079663352] [2022-07-13 15:56:58,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079663352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:56:58,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:56:58,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:56:58,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542379252] [2022-07-13 15:56:58,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:56:58,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:56:58,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:56:58,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:56:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:56:58,427 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:56:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:56:58,539 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-07-13 15:56:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:56:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-07-13 15:56:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:56:58,541 INFO L225 Difference]: With dead ends: 45 [2022-07-13 15:56:58,541 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 15:56:58,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:56:58,542 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:56:58,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:56:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 15:56:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 15:56:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:56:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-13 15:56:58,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 30 [2022-07-13 15:56:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:56:58,552 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-13 15:56:58,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:56:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-13 15:56:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 15:56:58,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:56:58,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:56:58,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:56:58,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:56:58,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:56:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:56:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash -964575686, now seen corresponding path program 1 times [2022-07-13 15:56:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:56:58,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956043394] [2022-07-13 15:56:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:56:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:56:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:56:58,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:56:58,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:56:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:56:58,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-13 15:56:58,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:56:59,258 INFO L356 Elim1Store]: treesize reduction 90, result has 7.2 percent of original size [2022-07-13 15:56:59,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 16 [2022-07-13 15:56:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:56:59,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:03,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:57:03,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956043394] [2022-07-13 15:57:03,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956043394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:03,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1611731029] [2022-07-13 15:57:03,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:57:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:57:03,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:57:03,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-07-13 15:57:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:03,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:57:03,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:03,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:57:05,985 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|))) is different from true [2022-07-13 15:57:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 15:57:06,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:18,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1611731029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:18,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:18,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 20 [2022-07-13 15:57:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674512597] [2022-07-13 15:57:18,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:18,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 15:57:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:57:18,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 15:57:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=538, Unknown=9, NotChecked=46, Total=650 [2022-07-13 15:57:18,671 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:57:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:57:36,234 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-07-13 15:57:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:57:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 33 [2022-07-13 15:57:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:57:36,236 INFO L225 Difference]: With dead ends: 71 [2022-07-13 15:57:36,237 INFO L226 Difference]: Without dead ends: 53 [2022-07-13 15:57:36,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=219, Invalid=1493, Unknown=14, NotChecked=80, Total=1806 [2022-07-13 15:57:36,238 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:57:36,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 225 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 370 Invalid, 0 Unknown, 79 Unchecked, 0.5s Time] [2022-07-13 15:57:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-13 15:57:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-07-13 15:57:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:57:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-13 15:57:36,245 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 33 [2022-07-13 15:57:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:57:36,246 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-13 15:57:36,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 15:57:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-13 15:57:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:57:36,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:57:36,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:57:36,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:36,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:57:36,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:57:36,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:57:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:57:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash -436474905, now seen corresponding path program 1 times [2022-07-13 15:57:36,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:57:36,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082104890] [2022-07-13 15:57:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:36,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:57:36,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:57:36,653 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:57:36,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:57:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:36,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-13 15:57:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:39,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:57:39,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:57:39,740 INFO L356 Elim1Store]: treesize reduction 144, result has 32.4 percent of original size [2022-07-13 15:57:39,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 81 [2022-07-13 15:57:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:57:40,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:44,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:57:44,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082104890] [2022-07-13 15:57:44,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082104890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:44,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [783290329] [2022-07-13 15:57:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:57:44,654 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:57:44,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:57:44,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:57:44,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-13 15:57:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:57:44,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 15:57:44,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:57:44,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:57:46,912 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|))) is different from true [2022-07-13 15:57:49,115 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3|))) is different from true [2022-07-13 15:57:49,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-07-13 15:57:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2022-07-13 15:57:49,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:57:59,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [783290329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:57:59,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:57:59,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 27 [2022-07-13 15:57:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192188452] [2022-07-13 15:57:59,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:57:59,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 15:57:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:57:59,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 15:57:59,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=795, Unknown=9, NotChecked=114, Total=992 [2022-07-13 15:57:59,605 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 15:58:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:10,730 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-13 15:58:10,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 15:58:10,734 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2022-07-13 15:58:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:10,736 INFO L225 Difference]: With dead ends: 69 [2022-07-13 15:58:10,737 INFO L226 Difference]: Without dead ends: 67 [2022-07-13 15:58:10,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=188, Invalid=1973, Unknown=9, NotChecked=182, Total=2352 [2022-07-13 15:58:10,738 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:10,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 403 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 337 Unchecked, 0.3s Time] [2022-07-13 15:58:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-13 15:58:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-07-13 15:58:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:58:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-07-13 15:58:10,755 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 36 [2022-07-13 15:58:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:10,756 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-07-13 15:58:10,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 15:58:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-07-13 15:58:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:58:10,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:10,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:10,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:10,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-13 15:58:11,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:58:11,162 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:11,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2024822807, now seen corresponding path program 2 times [2022-07-13 15:58:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:58:11,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207963633] [2022-07-13 15:58:11,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:58:11,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:58:11,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:58:11,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:58:11,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 15:58:11,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:58:11,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:11,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:58:11,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:58:11,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:58:11,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:58:11,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207963633] [2022-07-13 15:58:11,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207963633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:58:11,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:58:11,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:58:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672153715] [2022-07-13 15:58:11,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:58:11,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:58:11,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:58:11,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:58:11,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:58:11,245 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:58:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:11,260 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-07-13 15:58:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:58:11,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-07-13 15:58:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:11,261 INFO L225 Difference]: With dead ends: 93 [2022-07-13 15:58:11,261 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 15:58:11,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-07-13 15:58:11,262 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:11,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:58:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 15:58:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-13 15:58:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 15:58:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-07-13 15:58:11,272 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 36 [2022-07-13 15:58:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:11,273 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-07-13 15:58:11,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 15:58:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-07-13 15:58:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 15:58:11,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:11,275 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:11,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:11,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:58:11,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1337034520, now seen corresponding path program 3 times [2022-07-13 15:58:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:58:11,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250936768] [2022-07-13 15:58:11,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:58:11,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:58:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:58:11,487 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:58:11,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 15:58:11,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 15:58:11,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:11,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:58:11,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:11,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:58:13,607 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3|))) is different from true [2022-07-13 15:58:15,676 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4|))) is different from true [2022-07-13 15:58:15,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-07-13 15:58:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 4 not checked. [2022-07-13 15:58:15,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:17,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:58:17,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250936768] [2022-07-13 15:58:17,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250936768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [629536641] [2022-07-13 15:58:17,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:58:17,851 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 15:58:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 15:58:17,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 15:58:17,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-07-13 15:58:17,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 15:58:17,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:17,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 15:58:17,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:17,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 15:58:19,971 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4|))) is different from true [2022-07-13 15:58:22,022 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) is different from true [2022-07-13 15:58:22,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-07-13 15:58:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 4 not checked. [2022-07-13 15:58:22,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:22,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [629536641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:58:22,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:58:22,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2022-07-13 15:58:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964534410] [2022-07-13 15:58:22,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:22,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 15:58:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:58:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 15:58:22,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=110, Unknown=5, NotChecked=92, Total=240 [2022-07-13 15:58:22,089 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 15:58:24,142 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4|)))) is different from true [2022-07-13 15:58:26,190 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4|)))) is different from true [2022-07-13 15:58:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:26,254 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-07-13 15:58:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:58:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-07-13 15:58:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:26,256 INFO L225 Difference]: With dead ends: 61 [2022-07-13 15:58:26,256 INFO L226 Difference]: Without dead ends: 57 [2022-07-13 15:58:26,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=58, Invalid=199, Unknown=7, NotChecked=198, Total=462 [2022-07-13 15:58:26,256 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:26,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 183 Unchecked, 0.1s Time] [2022-07-13 15:58:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-13 15:58:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2022-07-13 15:58:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:58:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-07-13 15:58:26,261 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-07-13 15:58:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:26,261 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-07-13 15:58:26,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 15:58:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-07-13 15:58:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 15:58:26,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:26,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:26,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 15:58:26,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-07-13 15:58:26,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-13 15:58:26,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1296764353, now seen corresponding path program 1 times [2022-07-13 15:58:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:58:26,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093334321] [2022-07-13 15:58:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:58:26,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:58:26,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:58:26,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:58:26,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 15:58:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:58:26,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 15:58:26,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:58:28,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:58:29,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:58:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093334321] [2022-07-13 15:58:29,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093334321] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:29,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:58:29,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2022-07-13 15:58:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293438108] [2022-07-13 15:58:29,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 15:58:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:58:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 15:58:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-13 15:58:29,987 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 15:58:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:58:37,168 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-07-13 15:58:37,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 15:58:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2022-07-13 15:58:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:58:37,170 INFO L225 Difference]: With dead ends: 80 [2022-07-13 15:58:37,170 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 15:58:37,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=373, Invalid=1187, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 15:58:37,171 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 96 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:58:37,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 216 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 15:58:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 15:58:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-07-13 15:58:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:58:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-07-13 15:58:37,182 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 40 [2022-07-13 15:58:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:58:37,182 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-07-13 15:58:37,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 15:58:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-07-13 15:58:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 15:58:37,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:58:37,184 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:58:37,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:58:37,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:58:37,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:58:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:58:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1272141330, now seen corresponding path program 2 times [2022-07-13 15:58:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:58:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344350341] [2022-07-13 15:58:37,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:58:37,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:58:37,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:58:37,394 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:58:37,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 15:58:37,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:58:37,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:58:37,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 15:58:37,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:58:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 15:58:39,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:58:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 15:58:42,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:58:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344350341] [2022-07-13 15:58:42,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344350341] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:58:42,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:58:42,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2022-07-13 15:58:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500365295] [2022-07-13 15:58:42,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:58:42,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 15:58:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:58:42,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 15:58:42,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2022-07-13 15:58:42,494 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 15:59:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:59:27,870 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2022-07-13 15:59:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-13 15:59:27,872 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2022-07-13 15:59:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:59:27,873 INFO L225 Difference]: With dead ends: 122 [2022-07-13 15:59:27,873 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 15:59:27,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=1012, Invalid=3410, Unknown=0, NotChecked=0, Total=4422 [2022-07-13 15:59:27,875 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 237 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:59:27,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 228 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-13 15:59:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 15:59:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-13 15:59:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 15:59:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-07-13 15:59:27,890 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 49 [2022-07-13 15:59:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:59:27,891 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-07-13 15:59:27,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 15:59:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-07-13 15:59:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 15:59:27,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:59:27,894 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:59:27,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 15:59:28,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:59:28,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:59:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:59:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2075652366, now seen corresponding path program 3 times [2022-07-13 15:59:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:59:28,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102904401] [2022-07-13 15:59:28,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:59:28,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:59:28,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:59:28,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:59:28,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 15:59:28,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 15:59:28,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:59:28,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 15:59:28,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:59:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-13 15:59:29,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:59:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-13 15:59:31,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:59:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102904401] [2022-07-13 15:59:31,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102904401] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:59:31,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:59:31,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-13 15:59:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677284344] [2022-07-13 15:59:31,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:59:31,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:59:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:59:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:59:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-13 15:59:31,301 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 15:59:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:59:32,119 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-07-13 15:59:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:59:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2022-07-13 15:59:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:59:32,121 INFO L225 Difference]: With dead ends: 68 [2022-07-13 15:59:32,121 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 15:59:32,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-07-13 15:59:32,122 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:59:32,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 129 Invalid, 0 Unknown, 9 Unchecked, 0.2s Time] [2022-07-13 15:59:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 15:59:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 15:59:32,123 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-07-13 15:59:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 15:59:32,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2022-07-13 15:59:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:59:32,124 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 15:59:32,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 15:59:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 15:59:32,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 15:59:32,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:59:32,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:59:32,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:59:32,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 15:59:55,892 WARN L233 SmtUtils]: Spent 20.86s on a formula simplification. DAG size of input: 133 DAG size of output: 27 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-13 16:00:03,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 16:00:03,308 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-07-13 16:00:03,308 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (or (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|) |ULTIMATE.start_check_~n#1|)) (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~n#1|))) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))) (and (= (_ bv0 32) |ULTIMATE.start_lcp_~l~0#1|) (= |ULTIMATE.start_check_~l#1| (_ bv0 32)) (= |ULTIMATE.start_lcp_#res#1| (_ bv0 32)))) [2022-07-13 16:00:03,308 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L895 garLoopResultBuilder]: At program point L21(lines 16 22) the Hoare annotation is: (or (and (= (_ bv0 32) |ULTIMATE.start_lcp_~l~0#1|) (= |ULTIMATE.start_lcp_#res#1| (_ bv0 32))) (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)))))) [2022-07-13 16:00:03,309 INFO L902 garLoopResultBuilder]: At program point L48(lines 35 49) the Hoare annotation is: true [2022-07-13 16:00:03,309 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: false [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~l~0#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (or (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|) |ULTIMATE.start_check_~n#1|)) (not (bvslt (bvadd |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~n#1|))) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_check_~i~0#1| (_ BitVec 32)) (|ULTIMATE.start_check_~x#1| (_ BitVec 32)) (|ULTIMATE.start_check_~a#1.offset| (_ BitVec 32)) (|ULTIMATE.start_check_~y#1| (_ BitVec 32))) (let ((.cse1 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32))) (.cse2 (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)))) (and (= (select .cse1 (bvadd |ULTIMATE.start_check_~a#1.offset| .cse2 (bvmul (_ bv4 32) |ULTIMATE.start_check_~x#1|))) |ULTIMATE.start_check_#t~mem10#1|) (= (select .cse1 (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_check_~y#1|) .cse2)) |ULTIMATE.start_check_#t~mem11#1|)))) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|)) (not (bvslt (bvadd |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_#res#1|) |ULTIMATE.start_main_~n~0#1|))) (= .cse0 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))) [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 33) no Hoare annotation was computed. [2022-07-13 16:00:03,309 INFO L899 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L895 garLoopResultBuilder]: At program point L18-5(lines 18 20) the Hoare annotation is: (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~x#1|) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)))) [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (bvsge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_#t~malloc15#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv1073741824 32)) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))) [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 14) the Hoare annotation is: true [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point L13-3(lines 12 14) no Hoare annotation was computed. [2022-07-13 16:00:03,310 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 14) no Hoare annotation was computed. [2022-07-13 16:00:03,311 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-07-13 16:00:03,313 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1] [2022-07-13 16:00:03,315 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:00:03,320 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) 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.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:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-07-13 16:00:03,323 INFO L158 Benchmark]: Toolchain (without parser) took 186251.53ms. Allocated memory was 46.1MB in the beginning and 69.2MB in the end (delta: 23.1MB). Free memory was 21.9MB in the beginning and 26.1MB in the end (delta: -4.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-07-13 16:00:03,324 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:00:03,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.62ms. Allocated memory was 46.1MB in the beginning and 56.6MB in the end (delta: 10.5MB). Free memory was 21.7MB in the beginning and 38.8MB in the end (delta: -17.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-07-13 16:00:03,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.04ms. Allocated memory is still 56.6MB. Free memory was 38.6MB in the beginning and 36.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:00:03,324 INFO L158 Benchmark]: Boogie Preprocessor took 43.19ms. Allocated memory is still 56.6MB. Free memory was 36.8MB in the beginning and 35.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:00:03,324 INFO L158 Benchmark]: RCFGBuilder took 335.88ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 34.6MB in the end (delta: 791.1kB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-07-13 16:00:03,325 INFO L158 Benchmark]: TraceAbstraction took 185523.69ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.0MB in the beginning and 26.1MB in the end (delta: 7.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-07-13 16:00:03,326 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.62ms. Allocated memory was 46.1MB in the beginning and 56.6MB in the end (delta: 10.5MB). Free memory was 21.7MB in the beginning and 38.8MB in the end (delta: -17.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.04ms. Allocated memory is still 56.6MB. Free memory was 38.6MB in the beginning and 36.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.19ms. Allocated memory is still 56.6MB. Free memory was 36.8MB in the beginning and 35.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.88ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 34.6MB in the end (delta: 791.1kB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 185523.69ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.0MB in the beginning and 26.1MB in the end (delta: 7.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * 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: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 185.5s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 86.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 1528 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 608 IncrementalHoareTripleChecker+Unchecked, 1298 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1730 IncrementalHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 230 mSDtfsCounter, 1730 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 769 GetRequests, 516 SyntacticMatches, 10 SemanticMatches, 243 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 136.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=8, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 48 PreInvPairs, 87 NumberOfFragments, 314 HoareAnnotationTreeSize, 48 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 7148 FormulaSimplificationTreeSizeReductionInter, 30.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 63.4s InterpolantComputationTime, 466 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 607 ConstructedInterpolants, 71 QuantifiedInterpolants, 5879 SizeOfPredicates, 194 NumberOfNonLiveVariables, 1283 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 514/657 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: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:234) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 16:00:03,432 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias